pith. sign in

arxiv: 1610.06558 · v1 · pith:OTXYW4ECnew · submitted 2016-10-20 · 🧮 math.CO

Hamiltonicity of planar graphs with a forbidden minor

classification 🧮 math.CO
keywords graphsconnectedplanarhamiltonianminor-freeextendexamplesfamily
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.