Lean Arts, Meike Hopman, Veerle Timmermans
Published 2013-10-21Version 1
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.
Comments: 61 pages, numerous figures, appendix C++code. Written as student project under supervision of Wieb Bosma, Radboud University Nijmegen
Graphs with multi-$4$-cycles and the Barnette's conjecture
On Barnette's Conjecture and $H^{+-}$ property
A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma
![QR code for arXiv:1310.5504 [math.CO]](http://oss.arxitics.com/images/favicon.svg)