Graphs maximal with respect to absence of hamiltonian paths
Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 2, pp. 205-208
Two classes of graphs which are maximal with respect to the absence of Hamiltonian paths are presented. Block graphs with this property are characterized.
Keywords:
Hamiltonian path, block graph
@article{DMGT_1998_18_2_a6,
author = {Zelinka, Bohdan},
title = {Graphs maximal with respect to absence of hamiltonian paths},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {205--208},
year = {1998},
volume = {18},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_1998_18_2_a6/}
}
Zelinka, Bohdan. Graphs maximal with respect to absence of hamiltonian paths. Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 2, pp. 205-208. http://geodesic.mathdoc.fr/item/DMGT_1998_18_2_a6/
[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.
[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.
[3] G. Semanišin, Graphs maximal with respect to their characteristics, Dissertation, P.J. Šafárik University, Košice 1997.