Nonhamiltonian 3-Connected Cubic Planar Graphs
From MaRDI portal
Publication:4943701
DOI10.1137/S0895480198348665zbMath0941.05041OpenAlexW1983209214MaRDI QIDQ4943701
Derek Holton, Sheng Bau, Brendan D. McKay, R. E. L. Aldred
Publication date: 19 March 2000
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480198348665
Related Items (19)
Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes ⋮ Hamiltonian tetrahedralizations with Steiner points ⋮ On the vertex-arboricity of planar graphs ⋮ Improved bounds for hypohamiltonian graphs ⋮ Distance-two colourings of Barnette graphs ⋮ On the automorphism group of polyhedral graphs ⋮ Hamiltonian cycles in some family of cubic 3-connected plane graphs ⋮ On cyclic edge-connectivity of fullerenes ⋮ Small \(k\)-pyramids and the complexity of determining \(k\) ⋮ On Certain Graph Theory Applications ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ Combinatorial generation via permutation languages. II. Lattice congruences ⋮ Hamiltonian properties of generalized pyramids ⋮ Unnamed Item ⋮ Regular non-Hamiltonian polyhedral graphs ⋮ Circumference of essentially 4-connected planar triangulations ⋮ Construction of planar triangulations with minimum degree 5
Uses Software
This page was built for publication: Nonhamiltonian 3-Connected Cubic Planar Graphs
