Barnette's Conjecture
Combinatorics
2013-10-22 v1
Abstract
This report provides an overview of theorems and statements related to a conjecture stated by D.W. Barnette in 1969 (which is an open problem in graph theory): Every cubic, bipartite, polyhedral graph contains a Hamilton cycle.
Keywords
Cite
@article{arxiv.1310.5504,
title = {Barnette's Conjecture},
author = {Lean Arts and Meike Hopman and Veerle Timmermans},
journal= {arXiv preprint arXiv:1310.5504},
year = {2013}
}
Comments
61 pages, numerous figures, appendix C++code. Written as student project under supervision of Wieb Bosma, Radboud University Nijmegen