Polyhedral graphs without Hamiltonian cycles

DOI10.1016/S0166-218X(97)00047-4zbMath0883.05092OpenAlexW2018978975MaRDI QIDQ1373169

Hansjoachim Walther

Publication date: 16 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Hamiltonian cyclecircumferencefacespolyhedral cyclically \(k\)-connected graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Shortness coefficient of cyclically 4-edge-connected cubic graphs

Cites Work

• Unnamed Item
• Shortness coefficient of cyclically 5-connected cubic planar graphs
• Pairs of edge-disjoint Hamiltonian circuits
• Longest cycles in generalized Buckminsterfullerene graphs
• Shortness exponents of families of graphs
• Cyclically 5-edge-connected cubic planar graphs and shortness coefficients
• Über das Problem der Existenz von HAMILTONkreisen in planaren, regulären Graphen
• On Hamiltonian Circuits

This page was built for publication: Polyhedral graphs without Hamiltonian cycles