PDF

Discussiones Mathematicae Graph Theory 18(2) (1998) 205-208
DOI: https://doi.org/10.7151/dmgt.1076

GRAPHS MAXIMAL WITH RESPECT TO ABSENCE OF HAMILTONIAN PATHS

Bohdan Zelinka

Department of Applied Mathematics
Technical University of Liberec, Voronežská 13
461 17 Liberec, Czech Republic

Abstract

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.

1991 Mathematics Subject Classification: 05C45.

References

[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.

Received 15 December 1997
Revised 13 March 1998