Scaffold for the polyhedral embedding of cubic graphs
Combinatorics
2019-11-28 v1
Abstract
Let be a cubic graph and be a polyhedral embedding of this graph. The extended graph, of is the graph whose set of vertices is and whose set of edges is equal to , where is constructed as follows: given two vertices and in we say if there is a --path, 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 and polyhedral embeddings of .
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}
}