Hamiltonian circuits in polytopes with even sided faces
From MaRDI portal
Publication:1221772
DOI10.1007/BF02757273zbMath0317.05114OpenAlexW2065463969MaRDI QIDQ1221772
Publication date: 1975
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02757273
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)
Related Items (27)
On Barnette's conjecture and the \(H^{+-}\) property ⋮ On Finding Hamiltonian Cycles in Barnette Graphs ⋮ Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere ⋮ Longest cycles in generalized Buckminsterfullerene graphs ⋮ On a class of Hamiltonian polytopes ⋮ Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes ⋮ Construction of Barnette graphs whose large subgraphs are non-Hamiltonian ⋮ Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture ⋮ At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles ⋮ A note on Barnette's conjecture ⋮ Non-Hamiltonian simple 3-polytopes having just two types of faces ⋮ A note on Hamiltonian cycles in bipartite plane cubic maps having connectivity 2 ⋮ Shortness exponents for polytopes which are k-gonal modulo n ⋮ Distance-two colourings of Barnette graphs ⋮ Hamiltonian cycles in some family of cubic 3-connected plane graphs ⋮ Long cycles in fullerene graphs ⋮ Long cycles in fullerene graphs ⋮ On Barnette's conjecture ⋮ On the anti-Kekulé problem of cubic graphs ⋮ Hamiltonian circuits in prisms over certain simple 3-polytopes ⋮ A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian ⋮ Remarks on Barnette's conjecture ⋮ Unnamed Item ⋮ On cubic polyhedral graphs with prescribed adjacency properties of their faces ⋮ Matching theory and Barnette's conjecture ⋮ Hamiltonian cycles in cubic 3-connected bipartite planar graphs ⋮ On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
Cites Work
This page was built for publication: Hamiltonian circuits in polytopes with even sided faces
