Projective-planar double coverings of graphs

DOI10.1016/j.ejc.2004.02.011zbMath1076.05067OpenAlexW2067337386MaRDI QIDQ1767623

Seiya Negami

Publication date: 8 March 2005

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

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

zbMATH Keywords

coverplanar-cover 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) Structural characterization of families of graphs (05C75)

Related Items (1)

20 years of Negami's planar cover conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of projective-planar embeddings of graphs
• The spherical genus and virtually planar graphs
• 103 graphs that are irreducible for the projective plane
• Composite planar coverings of graphs
• A kuratowski theorem for the projective plane
• K4,4 ?e has no finite planar cover
• A note on possible extensions of Negami's conjecture
• Two graphs without planar covers

This page was built for publication: Projective-planar double coverings of graphs