Maximal nontraceable graphs with toughness less than one

zbMath1180.05056MaRDI QIDQ1010724

Marietjie Frick, Frank Bullock, Joy E. Singleton, Christina M. Mynhardt, Susan A. van Aardt

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117217

zbMATH Keywords

Hamiltonian pathtough graphsmaximal nontraceable graphMNT

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: Maximal nontraceable graphs with toughness less than one