English

Scaffold for the polyhedral embedding of cubic graphs

Combinatorics 2019-11-28 v1

Abstract

Let GG be a cubic graph and Π\Pi be a polyhedral embedding of this graph. The extended graph, Ge,G^{e}, of Π\Pi is the graph whose set of vertices is V(Ge)=V(G)V(G^{e})=V(G) and whose set of edges E(Ge)E(G^{e}) is equal to E(G)SE(G) \cup \mathcal{S}, where S\mathcal{S} is constructed as follows: given two vertices t0t_0 and t3t_3 in V(Ge)V(G^{e}) we say [t0t3]S,[t_0 t_3] \in \mathcal{S}, if there is a 33--path, (t0t1t2t3)G(t_0 t_1 t_2 t_3) \in G that is a Π\Pi-- facial subwalk of the embedding. We prove that there is a one to one correspondence between the set of possible extended graphs of GG and polyhedral embeddings of GG.

Keywords

Cite

@article{arxiv.1911.11863,
  title  = {Scaffold for the polyhedral embedding of cubic graphs},
  author = {Flor Aguilar and Gabriela Araujo-Pardo and Natalia García-Colín},
  journal= {arXiv preprint arXiv:1911.11863},
  year   = {2019}
}
R2 v1 2026-06-23T12:28:21.665Z