Planar Emulators Conjecture Is Nearly True for Cubic Graphs
Presented by Dr. Petr HLINěNý
Type: Oral presentation
Track: Graph Theory
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.