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 spec...

Full description

Bibliographic Details
Main Authors: Gunnar Brinkmann, Thomas Tucker, Nico Van Cleemput
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2021-11-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/6729/pdf