Two graphs without planar covers
From MaRDI portal
Recommendations
Cited in
(19)- The spherical genus and virtually planar graphs
- Composite planar coverings of graphs
- 3-connected reduction for regular graph covers
- Projective-planar double coverings of graphs
- Non-1-planarity of lexicographic products of graphs
- Another two graphs with no planar covers
- On the complexity of planar covering of small graphs
- On the parity of planar covers
- scientific article; zbMATH DE number 4106877 (Why is no real title available?)
- K4,4 ?e has no finite planar cover
- On possible counterexamples to Negami's planar cover conjecture
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- A note on possible extensions of Negami's conjecture
- 20 years of Negami's planar cover conjecture
- Another approach to planar cover conjecture focusing on rotation systems
- \(K_{1, 2, 2, 2}\) has no \(n\)-fold planar cover for \(n<14\)
- Computational complexity of covering multigraphs with semi-edges: small cases
- Computational complexity of covering regular trees
- Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
This page was built for publication: Two graphs without planar covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798122)
