Planar emulators conjecture is nearly true for cubic graphs

DOI10.1016/j.ejc.2015.02.009zbMath1314.05047OpenAlexW2040632432WikidataQ123225058 ScholiaQ123225058MaRDI QIDQ2346578

Martin Derka, Petr Hliněný

Publication date: 2 June 2015

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.02.009

zbMATH Keywords

finite planar coverFellows' conjecture

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)

Cites Work

• Unnamed Item
• 20 years of Negami's planar cover conjecture
• Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
• Enumeration of projective-planar embeddings of graphs
• Cubic irreducible graphs for the projective plane
• How not to characterize planar-emulable graphs
• On possible counterexamples to Negami's planar cover conjecture

This page was built for publication: Planar emulators conjecture is nearly true for cubic graphs