@article {IOPORT.05540923,
    author       = {Bullock, Frank and Frick, Marietjie and Singleton, Joy and van Aardt, Susan and Mynhardt, Kieka},
    title        = {Maximal nontraceable graphs with toughness less than one.},
    year         = {2008},
    journal      = {The Electronic Journal of Combinatorics [electronic only]},
    volume       = {15},
    number       = {1},
    issn         = {1077-8926},
    pages        = {Research Paper R18, 19 p.},
    publisher    = {Prof. Andr\'e K\"undgen, Deptartment of Mathematics, California State University San Marcos, San Marcos, CA},
    abstract     = {Summary: A graph $G$ is maximal nontraceable (MNT) if $G$ does not have a Hamiltonian path but, for every $e\in E(\overline{G}) $, the graph $G+e$ has a Hamiltonian path. A graph $G$ is 1-tough if for every vertex cut $S$ of $G$ the number of components of $G-S$ is at most $|S|$. We investigate the structure of MNT graphs that are not 1-tough. Our results enable us to construct several interesting new classes of MNT graphs.},
    identifier   = {05540923},
}