Cubic maximal nontraceable graphs
arXiv:math/0407290
Abstract
We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.
9 pages, 6 figures