Scaffold for the polyhedral embedding of cubic graphs
Abstract
Let G be a cubic graph and be a polyhedral embedding of this graph. The extended graph, Ge, of is the graph whose set of vertices is V(Ge)=V(G) and whose set of edges E(Ge) is equal to E(G) S, where S is constructed as follows: given two vertices t0 and t3 in V(Ge) we say [t0 t3] ∈ S, if there is a 3--path, (t0 t1 t2 t3) ∈ G that is a -- facial subwalk of the embedding. We prove that there is a one to one correspondence between the set of possible extended graphs of G and polyhedral embeddings of G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.