Closure and Hamiltonian-connectivity of claw-free graphs

Discrete Mathematics

Volumn 195, Issue 1-3, 1999, Pages 67-80

  Bollobás, Béla ^a   Riordan, Oliver ^a   Ryjáček, Zdeněk ^b   Saito, Akira ^c   Schelp, R H ^a  

^a University of Memphis   (United States)

^b UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

^c NIHON UNIVERSITY   (Japan)

Author keywords

Claw free graph; Closure; Hamiltonian connected graph; Homogeniously traceable graph; Locally connected vertex

Indexed keywords

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

References (4)

1. S. Brandt, O. Favaron, Z. Ryjáček, Closure and stable hamiltonian properties in claw-free graphs, UM Combinatorics Preprint Series, No. 23, The University of Memphis, 1997.
2. G. Chartrand, L. Lesniak, Graphs & Digraphs (2nd ed.), Wadsworth & Brooks/Cole, Monterey, CA, 1986.
3. Z. Ryjáček, On a closure concept in claw-free graphs, J. Combin. Theory Ser. B 70 (1997) 217-224.
4. D.P. Sumner, Graphs with 1-factors, Proc. Amer. Math. Soc. 42 (1974) 8-12.