On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks
From MaRDI portal
Publication:1141659
DOI10.1016/0095-8956(80)90072-6zbMath0438.05042MaRDI QIDQ1141659
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90072-6
05C45: Eulerian and Hamiltonian graphs
Related Items
Shortness coefficient of cyclically 5-connected cubic planar graphs, Bipartite regular graphs and shortness parameters, Shortness parameters of families of regular planar graphs in two or three types of faces, Regular non-Hamiltonian polyhedral graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairs of Hamiltonian circuits in 5-connected planar graphs
- Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes
- Pairs of edge-disjoint Hamiltonian circuits
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- The footballers of Croam
- A Theorem on Planar Graphs
- Über das Problem der Existenz von HAMILTONkreisen in planaren, regulären Graphen