Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons

DOI10.1016/0012-365X(81)90239-9zbMath0473.05043OpenAlexW2050939225MaRDI QIDQ1158440

Peter J. Owens

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90239-9

zbMATH Keywords

Hamiltonian circuit3-polytope

Mathematics Subject Classification ID

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

Related Items (8)

Cyclically 5-edge-connected cubic planar graphs and shortness coefficients ⋮ Drawing Planar Graphs with Many Collinear Vertices ⋮ Shortness parameters of families of regular planar graphs in two or three types of faces ⋮ Long cycles in fullerene graphs ⋮ Regular planar graphs with faces of only two types and shortness parameters ⋮ Every collinear set in a planar graph is free ⋮ Shortness coefficient of cyclically 5-connected cubic planar graphs ⋮ On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles

Cites Work

• Unnamed Item
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Shortness parameters of families of regular planar graphs in two or three types of faces
• Non-Hamiltonian non-Grinbergian graphs
• Shortness exponents of families of graphs
• Non-Hamiltonian Simple Planar Graphs
• On Hamiltonian Circuits

This page was built for publication: Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons