What's the largest n such that any 3-connected graph of order n is hamiltonian?

27 Views Asked by At

I've figured out it's true for $n$ up to 6, using Ore's theorem. I'm not sure how to find an example of a non-hamiltonian 3-connected graph.