Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
From MaRDI portal
Publication:1124606
DOI10.1007/BF01839493zbMATH Open0679.05049MaRDI QIDQ1124606FDOQ1124606
Authors: Moshe Rosenfeld
Publication date: 1989
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/137314
Recommendations
Cites Work
- A Theorem on Planar Graphs
- Pairs of edge-disjoint Hamiltonian circuits
- The existence of certain planar maps
- Polytopes, graphs, and complexes
- Non-Hamiltonian cubic planar maps
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes
- Hamiltonian circuits in certain prisms
- Cyclability of r-regular r-connected graphs
- Title not available (Why is that?)
Cited In (6)
- On the Circumference of Essentially 4-connected Planar Graphs
- Title not available (Why is that?)
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- Hamiltonian cycles and 1-factors in 5-regular graphs
- Addendum to the article: Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
This page was built for publication: Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124606)