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.
Keywords :
Hamiltonian path , Maximal nonhamiltonian , Hamiltonian , Hamiltonian cycle , Nontraceable , Maximal hypohamiltonian , Traceable , Hypohamiltonian , Maximal nontraceable , Nonhamiltonian
