Erratum to: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices

DOI10.1016/0095-8956(89)90025-7zbMath0699.05035OpenAlexW4211114522MaRDI QIDQ912862

Derek Holton, Brendan D. McKay

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90025-7

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Length, area and volume in real or complex geometry (51M25) Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items (1)

On the vertex-arboricity of planar graphs

This page was built for publication: Erratum to: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices