Publication details

Planar Emulators Conjecture Is Nearly True for Cubic Graphs



Year of publication 2013
Type Article in Proceedings
Conference The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013
MU Faculty or unit

Faculty of Informatics

Web conference
Field General mathematics
Keywords planar cover; planar emulator; projective planar; splitter theorem
Description We prove that a cubic nonprojective graph cannot have a finite planar emulator, unless one of two very special cases happen (in which the answer is open). This shows that Fellows' planar emulator conjecture, disproved for general graphs by Rieck and Yamashita in 2008, is nearly true on cubic graphs, and might very well be true there definitely.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info