Shortness coefficient of cyclically 5-connected cubic planar graphs

DOI10.1007/BF02189602zbMath0518.05045MaRDI QIDQ1053709

Joseph Zaks

Publication date: 1982

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136951

zbMATH Keywords

planar graphslargest circuitshortness coefficient

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items (5)

Cyclically 5-edge-connected cubic planar graphs and shortness coefficients ⋮ Polyhedral graphs without Hamiltonian cycles ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Non-Hamiltonian cubic planar maps
• On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons
• Extending an extension of Grinberg's theorem
• Shortness parameters of families of regular planar graphs in two or three types of faces
• Pairs of edge-disjoint Hamiltonian circuits
• On an extension of the Grinberg theorem
• Shortness exponents of families of graphs

This page was built for publication: Shortness coefficient of cyclically 5-connected cubic planar graphs