Hamiltonian circuits in polytopes with even sided faces

From MaRDI portal
Revision as of 08:12, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1221772


DOI10.1007/BF02757273zbMath0317.05114MaRDI QIDQ1221772

Paul R. Goodey

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


05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

52Bxx: Polytopes and polyhedra


Related Items

Hamiltonian cycles in some family of cubic 3-connected plane graphs, Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes, On the anti-Kekulé problem of cubic graphs, 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 Finding Hamiltonian Cycles in Barnette Graphs, 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, On Barnette's conjecture and the \(H^{+-}\) property, Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere, A note on Barnette's conjecture, Hamiltonian cycles in cubic 3-connected bipartite planar graphs, On Barnette's conjecture, On a class of Hamiltonian polytopes, 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, Hamiltonian circuits in prisms over certain simple 3-polytopes, On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles, Longest cycles in generalized Buckminsterfullerene graphs, On cubic polyhedral graphs with prescribed adjacency properties of their faces, Matching theory and Barnette's conjecture, Construction of Barnette graphs whose large subgraphs are non-Hamiltonian, Distance-two colourings of Barnette graphs, Remarks on Barnette's conjecture, Unnamed Item



Cites Work