Nonhamiltonian 3-Connected Cubic Planar Graphs
From MaRDI portal
Recommendations
Cited in
(29)- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- Non-Hamiltonian bicubic graphs
- On cubic polyhedral graphs with prescribed adjacency properties of their faces
- Hamiltonian tetrahedralizations with Steiner points
- On the automorphism group of polyhedral graphs
- Polyhedra of small order and their Hamiltonian properties
- Non-hamiltonian polyhedral graphs with two types of faces
- Combinatorial generation via permutation languages. II. Lattice congruences
- Distance-two colourings of Barnette graphs
- Small \(k\)-pyramids and the complexity of determining \(k\)
- Shortness coefficient of cyclically 4-edge-connected cubic graphs
- Regular non-Hamiltonian polyhedral graphs
- On the vertex-arboricity of planar graphs
- Construction of planar triangulations with minimum degree 5
- Hamiltonian properties of generalized pyramids
- On Certain Graph Theory Applications
- Improved bounds for hypo-Hamiltonian graphs
- Longest cycles in cyclically 4-edge-connected cubic planar graphs
- Hamiltonian cycles in some family of cubic 3-connected plane graphs
- Hamiltonicity of cubic planar graphs with bounded face sizes
- A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian
- On measures of nonplanarity of cubic graphs
- Circumference of essentially 4-connected planar triangulations
- Automated Deduction in Geometry
- On non-traceable 3-connected planar cubic graphs of minimum order
- Affine optimal k-proper connected edge colorings
- On Tutte cycles containing three prescribed edges
- Hamiltonian properties of polyhedra with few 3-cuts. A survey
- On cyclic edge-connectivity of fullerenes
This page was built for publication: Nonhamiltonian 3-Connected Cubic Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943701)
