Here's a quickie:
Let $r\ge2$. Does every connected $r$-regular bipartite graph contain a Hamiltonian cycle?
I've been playing around with this for almost an hour, but I can't prove it.
Here's a quickie:
Let $r\ge2$. Does every connected $r$-regular bipartite graph contain a Hamiltonian cycle?
I've been playing around with this for almost an hour, but I can't prove it.
The Horton graph is cubic, 3-connected, bipartite, and non-Hamiltonian. There is a conjecture of Barnette (see here) that cubic, 3-connected, bipartite, planar graphs are Hamiltonian. This has yet to be proven or disproven.