Lesson plan

Graph-encoded map

In topological graph theory, a graph-encoded map or gem is a method of encoding a cellular embedding of a graph using a different graph with four vertices per edge of the original graph. It is the topological analogue of runcination, a geometric operation on polyhedra. Graph-encoded maps were formulated and named by . Alternative and equivalent systems for representing cellular embeddings include signed rotation systems and ribbon graphs. The graph-encoded map for an embedded graph G is another cubic graph H together with a 3-edge-coloring of H . Each edge e of G is expanded into exactly four vertices in H , one for each choice of a side and endpoint of the edge. An edge in H connects each such vertex to the vertex representing the opposite side and same endpoint of e ; these edges are by convention colored red. Another edge in H connects each vertex to the vertex representing the opposite endpoint and same side of e ; these edges are by convention colored blue. An edge in H of the third color, yellow, connects each vertex to the vertex representing another edge e' that meets e at the same side and endpoint. An alternative description of H is that it has a vertex for each flag of G (a mutually incident triple of a vertex, edge, and face).…

Back to article

Article summary

In topological graph theory, a graph-encoded map or gem is a method of encoding a cellular embedding of a graph using a different graph with four vertices per edge of the original graph. It is the topological analogue of runcination, a geometric operation on polyhedra. Graph-encoded maps were formulated and named by . Alternative and equivalent systems for representing cellular embeddings include signed rotation systems and ribbon graphs. The graph-encoded map for an embedded graph G is another cubic graph H together with a 3-edge-coloring of H . Each edge e of G is expanded into exactly four vertices in H , one for each choice of a side and endpoint of the edge. An edge in H connects each such vertex to the vertex representing the opposite side and same endpoint of e ; these edges are by convention colored red. Another edge in H connects each vertex to the vertex representing the opposite endpoint and same side of e ; these edges are by convention colored blue. An edge in H of the third color, yellow, connects each vertex to the vertex representing another edge e' that meets e at the same side and endpoint. An alternative description of H is that it has a vertex for each flag of G (a mutually incident triple of a vertex, edge, and face).…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.