A computer-assisted proof of Barnette-Goodey conjecture: Not only fullerene graphs are Hamiltonian
Combinatorics
2017-08-18 v2
Abstract
Fullerene graphs, i.e., 3-connected planar cubic graphs with pentagonal and hexagonal faces, are conjectured to be Hamiltonian. This is a special case of a conjecture of Barnette and Goodey, stating that 3-connected planar graphs with faces of size at most 6 are Hamiltonian. We prove the conjecture.
Keywords
Cite
@article{arxiv.1409.2440,
title = {A computer-assisted proof of Barnette-Goodey conjecture: Not only fullerene graphs are Hamiltonian},
author = {František Kardoš},
journal= {arXiv preprint arXiv:1409.2440},
year = {2017}
}