Bipartite cubic graphs and a shortness exponent

The class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph with only 78 vertices and to have a shortness exponent less than one.