A class of Hamiltonian polytopes

DOI10.1002/jgt.3190010213zbMath0379.05037OpenAlexW1986801361MaRDI QIDQ4159402

Paul R. Goodey

Publication date: 1977

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

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Longest cycles in generalized Buckminsterfullerene graphs ⋮ On a class of Hamiltonian polytopes ⋮ Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes ⋮ At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles ⋮ Non-Hamiltonian simple 3-polytopes having just two types of faces ⋮ Hexagonal resonance of (3,6)-fullerenes ⋮ Distance-two colourings of Barnette graphs ⋮ Hamiltonian cycles in some family of cubic 3-connected plane graphs ⋮ On bicriticality of (3,6)-fullerene graphs ⋮ Long cycles in fullerene graphs ⋮ Long cycles in fullerene graphs ⋮ On the anti-Kekulé problem of cubic graphs ⋮ A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian ⋮ Unnamed Item ⋮ On the minimum leaf number of cubic graphs ⋮ Spectra of toroidal graphs ⋮ On cubic polyhedral graphs with prescribed adjacency properties of their faces ⋮ On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles

Cites Work

• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Unnamed Item

This page was built for publication: A class of Hamiltonian polytopes