Two classes of graphs which are maximal with respect to the absence of Hamiltonian paths are presented. Block graphs with this property are characterized.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1076,
author = {Bohdan Zelinka},
title = {Graphs maximal with respect to absence of hamiltonian paths},
journal = {Discussiones Mathematicae Graph Theory},
volume = {18},
year = {1998},
pages = {205-208},
zbl = {0935.05062},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1076}
}
Bohdan Zelinka. Graphs maximal with respect to absence of hamiltonian paths. Discussiones Mathematicae Graph Theory, Tome 18 (1998) pp. 205-208. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1076/
[000] [1] M. Borowiecki, I. Broere, M. Frick, P. Mihók and G. Semanišin, Survey of hereditary properties of graphs, Discuss. Math. Graph Theory 17 (1997) 5-50, doi: 10.7151/dmgt.1037. | Zbl 0902.05026
[001] [2] I. Broere, M. Frick and G. Semanišin, Maximal graphs with respect to hereditary properties, Discuss. Math. Graph Theory 17 (1997) 51-66, doi: 10.7151/dmgt.1038. | Zbl 0902.05027
[002] [3] G. Semanišin, Graphs maximal with respect to their characteristics, Dissertation, P.J. Šafárik University, Košice 1997.