Minimal 2-connected non-hamiltonian claw-free graphs

Discrete Mathematics

Volumn 191, Issue 1-3, 1998, Pages 57-64

  Brousek, Jan ^a  

^a UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006718990     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00093-4     Document Type: Article

References (8)

1. P. Bedrossian, Forbidden sugraph and minimum degree conditions for hamiltonicity, Thesis, Memphis State University, U.S.A., 1991.
2. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York, 1976.
3. H.J. Broersma, Z. Ryjáček, I. Schiermeyer, Unifying results on hamiltonian claw-free graphs, Preprint, University of West Bohemia, Pilsen, 1994.
4. 1,3-free graphs, in: R. Bodendiek (Ed.), Contemporary Methods in Graph Theory, BI-Wiss.-Verl., Mannheim-Wien-Zürich, 1990, pp. 181-194.
5. D. Duffus, M.S. Jacobson, R.J. Gould, Forbidden subgraphs and the hamiltonian theme, The Theory and Applications of Graphs, Kalamazoo, Mich. 1980, Wiley, New York, 1981, pp. 297-316.
6. R.J. Faudree, Z. Ryjáček, I. Schiermeyer, Forbidden subgraphs and cycle extendability, J. Combin. Math. Combin. Comput. 19 (1995) 109-128.
7. R. Faudree, Z. Ryjáček, I. Schiermeyer, Local connectivity and cycle extension in claw-free graphs, Ars Combin. 47 (1997) 185-190.
8. J.L. Fouquet, A strengthening of Ben Rebea's lemma, J. Combin. Theory Ser. B 59 (1993) 35-40.