English

Hamiltonicity of planar graphs with a forbidden minor

Combinatorics 2016-10-21 v1

Abstract

Tutte showed that 44-connected planar graphs are Hamiltonian, but it is well known that 33-connected planar graphs need not be Hamiltonian. We show that K2,5K_{2,5}-minor-free 33-connected planar graphs are Hamiltonian. This does not extend to K2,5K_{2,5}-minor-free 33-connected graphs in general, as shown by the Petersen graph, and does not extend to K2,6K_{2,6}-minor-free 33-connected planar graphs, as we show by an infinite family of examples.

Keywords

Cite

@article{arxiv.1610.06558,
  title  = {Hamiltonicity of planar graphs with a forbidden minor},
  author = {M. N. Ellingham and Emily A. Marshall and Kenta Ozeki and Shoichi Tsuchiya},
  journal= {arXiv preprint arXiv:1610.06558},
  year   = {2016}
}

Comments

18 pages, 29 figures