Non-Hamiltonian simple 3-polytopes having just two types of faces

DOI10.1016/0012-365X(90)90289-TzbMath0445.05065MaRDI QIDQ1145160

Joseph Zaks

Publication date: 1980

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

zbMATH Keywords

Hamiltonian circuit; 3-polytope

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

52Bxx: Polytopes and polyhedra

Related Items

Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes, A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian, Long cycles in fullerene graphs, Long cycles in fullerene graphs, On the simplicial 3-polytopes with only two types of edges, Shortness coefficient of cyclically 5-connected cubic planar graphs, Simple 3-polytopal graphs with edges of only two types and shortness coefficients, On a class of Hamiltonian polytopes, Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons, Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes, Shortness parameters of families of regular planar graphs in two or three types of faces, Shortness exponents for polytopes which are k-gonal modulo n, Shortness coefficients of simple 3-polytopal graphs with edges of only two types, On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles, Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters, Longest cycles in generalized Buckminsterfullerene graphs, Shortness coefficient of cyclically 4-edge-connected cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-Hamiltonian cubic planar maps
• On shortness exponents of families of graphs
• The existence of certain planar maps
• Hamiltonian circuits in polytopes with even sided faces
• Non-Hamiltonian non-Grinbergian graphs
• Shortness exponents of families of graphs
• A class of Hamiltonian polytopes
• Polytopes, graphs, and complexes