Zigzag and central circuit structure of two-faced plane graphs
published: Sept. 7, 2007, recorded: September 2007, views: 4174
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
A zigzag in a k-valent plane graph G is a circuit of edges, such that any two, but not three consecutive edges belong to the same face. A railroad in G is a circuit of evengonal faces, such that any face is adjacent to its neighbors on opposite edges. Boundary circuits of a railroad are two ”parallel” zigzags if k = 3, or, in a 4-valent graph, two such central circuits. We consider the zigzag and railroad structure of two-faced 3- and 4-valent plane graphs (generalizations of Platonic polyhedra) and their connections with other problems.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !