10.46298/dmtcs.6729
https://dmtcs.episciences.org/6729
Brinkmann, Gunnar
Gunnar
Brinkmann
Tucker, Thomas
Thomas
Tucker
Van Cleemput, Nico
Nico
Van Cleemput
On the genera of polyhedral embeddings of cubic graph
In this article we present theoretical and computational results on the
existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs.
We also describe an efficient algorithm to compute all polyhedral embeddings of
a given cubic graph and constructions for cubic graphs with some special
properties of their polyhedral embeddings. Some key results are that even cubic
graphs with a polyhedral embedding on the torus can also have polyhedral
embeddings in arbitrarily high genus, in fact in a genus {\em close} to the
theoretical maximum for that number of vertices, and that there is no bound on
the number of genera in which a cubic graph can have a polyhedral embedding.
While these results suggest a large variety of polyhedral embeddings,
computations for up to 28 vertices suggest that by far most of the cubic graphs
do not have a polyhedral embedding in any genus and that the ratio of these
graphs is increasing with the number of vertices.
Comment: The C-program implementing the algorithm described in this article
can be obtained from any of the authors
episciences.org
Mathematics - Combinatorics
2021-10-06
2021-11-05
2021-11-05
eng
journal article
arXiv:2008.09467
10.48550/arXiv.2008.09467
1365-8050
https://dmtcs.episciences.org/6729/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
vol. 23, no. 3
Graph Theory
Researchers
Students