Singleton, Joy Elizabeth
(2009-08-25)
A graph G is maximal nontraceable (MNT) (maximal nonhamiltonian (MNH)) if G is not traceable (hamiltonian), i.e. does not contain a hamiltonian path (cycle), but G+xy is traceable
(hamiltonian) for all nonadjacent vertices ...