Cycles containing many vertices of subsets in 1-tough graphs with large degree sums

Ars Combinatoria

Volumn 48, Issue , 1998, Pages 195-212

  Li, Jianping ^a,b  

^a YUNNAN UNIVERSITY   (China)

^b CNRS   (France)

Author keywords

(X ) dominating cycle; (X ) longest cycle; Hamiltonian graph; Large degree sums; Vertex degree

Indexed keywords

EID: 0041181066     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. D. Bauer, H.J. Broersma and H.J. Yeldman, Around three lemmas in hamiltonian graph theory, In: R. Bodendiek and R. Henn, editors, Topics in Combinatorics and Graph Theory, Essays in Honour of Gerhand Ringel, Physica-Verlag, Heidelberg (1990) 101-110.
2. D. Bauer, A. Morgana, E.F. Schmeichel and H.J. Veldman. Long cycles in graphs with large degree sums. Discrete Math. 79 (1989/1990) 59-70.
3. A. Bigalke and H.A. Jung, Uber hamiltonsche kreise und unabhangige ecken in graphen, Monatsh. Math. 88(1979) 195-210.
4. J.A. Bondy and U.S.R. Murty, Graph Theory with Its Applications , Macmillan, London and Elserier, New York (1976).
5. H.J. Broersma, H. Li, J.P. Li, F. Tian and H.J. Veldman Cycles through subsets with degree sums, Discrete Math. 171 (1997), 43-54.
6. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math. 4 (1973) 215-228.
7. H.A. Jung, On maximal circuits in finite graphs, Annals of Discrete Math. 3 (1978) 129-144.
8. J.P. Li, Cycles containing many vertices of large degree in 2-connected graphs with large degree sums, preprint (1993).
9. J.P. Li, Cycles containing many vertices of subsets in 1-tough graphs with large degree sums, preprint (1994).
10. O. Ore, Note on hamilton circuits, Amer. Math. Monthly 67(1960), 55.