Closure and stable Hamiltonian properties in claw-free graphs

Journal of Graph Theory

Volumn 34, Issue 1, 2000, Pages 30-41

  Brandt, Stephan ^a   Favaron, Odile ^b   Ryjáček, Zdeněk ^c  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

Claw free graphs; Closure; Cycle extendability; Hamiltonicity; Pancyclicity; Stable property; Traceability

Indexed keywords

EID: 0034180098     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(200005)34:1<30::AID-JGT4>3.0.CO;2-R     Document Type: Article

References (9)

1. A. S. Asratian, Every 3-connected, locally connected, claw-free graph is hamilton-connected, J Graph Theory 23 (1996), 191-202.
2. J. A. Bondy and V. Chvátal, A method in graph theory, Discrete Math 15 (1976), 111-135.
3. J. A. Bondy and U. S. R. Murty, Graph theory with applications, Macmillan, London and Elsevier, New York, 1976.
4. S. Brandt, 9-connected claw-free graphs are Hamilton-connected, J Combin Theory Ser B 75 (1999), 167-173.
5. F. Jaeger, A note on sub-Eulerian graphs, J Graph Theory 3 (1979), 91-93.
6. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988), 261-277.
7. W. Mader, Minimale n-fach kantenzusammenhängende Graphen, Math Ann 191 (1971), 21-28.
8. Z. Ryjáček, On a closure concept in claw-free graphs, J Combin Theory Ser B 70 (1997), 217-224.
9. S. Zhan, On hamiltonian line graphs and connectivity, Discrete Math 89 (1991), 89-95.