Bullock, Frank, et al. "Maximal nontraceable graphs with toughness less than one.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R18, 19 p.-Research Paper R18, 19 p.. <http://eudml.org/doc/117217>.
@article{Bullock2008,
author = {Bullock, Frank, Frick, Marietjie, Singleton, Joy, van Aardt, Susan, Mynhardt, Kieka (C.M.)},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {maximal nontraceable graph; MNT; Hamiltonian path;tough graphs; Hamiltonian path; tough graphs},
language = {eng},
number = {1},
pages = {Research Paper R18, 19 p.-Research Paper R18, 19 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Maximal nontraceable graphs with toughness less than one.},
url = {http://eudml.org/doc/117217},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Bullock, Frank
AU - Frick, Marietjie
AU - Singleton, Joy
AU - van Aardt, Susan
AU - Mynhardt, Kieka (C.M.)
TI - Maximal nontraceable graphs with toughness less than one.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R18, 19 p.
EP - Research Paper R18, 19 p.
LA - eng
KW - maximal nontraceable graph; MNT; Hamiltonian path;tough graphs; Hamiltonian path; tough graphs
UR - http://eudml.org/doc/117217
ER -
