Cyclically 5-edge-connected cubic planar graphs and shortness coefficients

DOI10.1002/jgt.3190060411zbMath0502.05032OpenAlexW2026654660MaRDI QIDQ3967557

Peter J. Owens

Publication date: 1982

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190060411

zbMATH Keywords

cubic planar graphshortness coefficientcyclically connectednon-Hamiltonian graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (3)

Polyhedral graphs without Hamiltonian cycles ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Simple 3-polytopal graphs with edges of only two types and shortness coefficients

Cites Work

• Shortness coefficient of cyclically 5-connected cubic planar graphs
• Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons
• Non-Hamiltonian Simple Planar Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Cyclically 5-edge-connected cubic planar graphs and shortness coefficients