Maximal nontraceable graphs with toughness less than one (Q1010724)

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.