Two graphs without planar covers
From MaRDI portal
Recommendations
Cited in
(15)- scientific article; zbMATH DE number 4106877 (Why is no real title available?)
- On the parity of planar covers
- On the complexity of planar covering of small graphs
- A note on possible extensions of Negami's conjecture
- On possible counterexamples to Negami's planar cover conjecture
- 20 years of Negami's planar cover conjecture
- Another approach to planar cover conjecture focusing on rotation systems
- Non-1-planarity of lexicographic products of graphs
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
- The spherical genus and virtually planar graphs
- 3-connected reduction for regular graph covers
- Composite planar coverings of graphs
- Projective-planar double coverings of graphs
- Another two graphs with no planar covers
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)