Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture

DOI10.1016/j.ejc.2009.06.003zbMath1221.05096arXiv0812.3700OpenAlexW2001909387WikidataQ123128169 ScholiaQ123128169MaRDI QIDQ966145

Yo'av Rieck, Yasushi Yamashita

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.3700

zbMATH Keywords

Fellows' Conjecturefinite planar cover

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Mike Fellows: Weaving the Web of Mathematics and Adventure ⋮ 20 years of Negami's planar cover conjecture ⋮ RAAGs in Ham ⋮ Computing role assignments of proper interval graphs in polynomial time ⋮ Computing Role Assignments of Proper Interval Graphs in Polynomial Time ⋮ Computing role assignments of chordal graphs ⋮ Planar emulators conjecture is nearly true for cubic graphs

Cites Work

• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• The spherical genus and virtually planar graphs
• 103 graphs that are irreducible for the projective plane
• Graph minors. XIII: The disjoint paths problem
• Topological Graph Theory from Japan
• A kuratowski theorem for the projective plane
• Projective Planarity in Linear Time
• A note on possible extensions of Negami's conjecture
• Two graphs without planar covers