Graphs maximal with respect to absence of hamiltonian paths

• Autorzy: Bohdan Zelinka
• Języki publikacji: EN

Abstrakty

EN

Two classes of graphs which are maximal with respect to the absence of Hamiltonian paths are presented. Block graphs with this property are characterized.

Słowa kluczowe

EN

Hamiltonian path; block graph

Kategorie tematyczne

• 05C45: Eulerian and Hamiltonian graphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 1998
• Tom: 18
• Numer: 2
• Strony: 205-208

Daty

wydano

1998

otrzymano

1997-12-15

poprawiono

1998-03-13

Twórcy

autor

Bohdan Zelinka

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

Bibliografia

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

Identyfikatory

DOI

10.7151/dmgt.1076