Non-Hamiltonian bicubic graphs (Q1120592): Difference between revisions

A graph is said to be bicubic if it is bipartite and 3-regular. A graph is said to be cyclically 4-edge connected if any set of edges whose removal separates the graph into two parts both containing circuits, contains at least 3 edges. In the note, a non-Hamiltonian cyclically 4-edge connected bicubic graph of order 50 is constructed. This is the smallest non-Hamiltonian 3- connected bicubic graph known.