On k-ordered graphs

Journal of Graph Theory

Volumn 35, Issue 2, 2000, Pages 69-82

  Faudree, Jill R ^a   Faudree, Ralph J ^b   Gould, Ronald J ^d   Jacobson, Michael S ^c   Lesniak, Linda ^d  

^a UNIVERSITY OF ALASKA FAIRBANKS   (United States)

^b UNIVERSITY OF MEMPHIS   (United States)

^c UNIVERSITY OF LOUISVILLE   (United States)

^d University of Alaska ^*

Author keywords

Degree sum; k ordered; k ordered Hamiltonian; Neighborhood union

Indexed keywords

EID: 0034370734     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0118(200010)35:2<69::aid-jgt1>3.0.co;2-i     Document Type: Article

References (8)

1. B. Bollabás, Extremal Graph Theory, Academic Press, London, 1978.
2. B. Bollabás, and C. Thomason, Highly linked graphs, Combinatorics, Probability, and Computing (1993), 1-7.
3. H. Broersma, J. van den Heuvel, and H. Veldman, A generalization of Ore's Theorem involving neighborhood unions, Discrete Math 122 (1995), 37-49.
4. G. Chartrand and L. Lesniak, Graphs & Digraphs, Chapman and Hall, London, 1996.
5. R. Faudree, R. Gould, M. Jacobson, and L. Lesniak, Neighborhood unions and a generalization of Dirac's Theorem, Discrete Math 105 (1992), 61-71.
6. H. Kierstead, G. Sarkozy, and S. Selkow, On k-ordered Hamiltonian graphs, J Graph Theory 32 (1999), 17-25.
7. L. Ng and M. Schultz, k-Ordered Hamiltonian graphs, J Graph Theory 1 (1997), 45-57.
8. O. Ore, A note on Hamilton circuits, Amer Math Monthly 67 (1960), 55.