Barnette's Conjecture: Every 3-connected cubic planar bipartite graph is Hamiltonian. It is known that this is not true if you remove the "bipartite" condition, but the smallest 3-connected cubic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback