Shortness coefficient of cyclically 5-connected cubic planar graphs

DOI10.1007/BF02189602MaRDI QIDQ1053709zbMATH OpenFDO

Authors 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

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

Cites work

• Extending an extension of Grinberg's theorem
• Non-Hamiltonian cubic planar maps
• 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
• On an extension of the Grinberg theorem
• On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks
• Pairs of edge-disjoint Hamiltonian circuits
• Shortness exponents of families of graphs
• Shortness parameters of families of regular planar graphs in two or three types of faces

Cited in

(5)

• scientific article; zbMATH DE number 90550 (Why is no real title available?)
• Polyhedral graphs without Hamiltonian cycles
• Longest cycles in cyclically 4-edge-connected cubic planar graphs
• Shortness coefficient of cyclically 4-edge-connected cubic graphs
• Cyclically 5-edge-connected cubic planar graphs and shortness coefficients

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053709)