On k-ordered Hamiltonian graphs

Journal of Graph Theory

Volumn 32, Issue 1, 1999, Pages 17-25

  Kierstead, H A ^a   Sarkozy G N ^b   Selkow, S M ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b Worcester Polytechnic Institute   (United States)

Author keywords

Hamiltonian graph; k ordered

Indexed keywords

EID: 0039008403     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1097-0118(199909)32:1<17::aid-jgt2>3.0.co;2-g     Document Type: Article

References (5)

1. B. Bollobás, Extremal graph theory, Academic, London, 1978.
2. G. A. Dirac, Some theorems on abstract graphs, Proc London Math Soc 2 (1952), 68-81.
3. J. Komlós, G. N. Sárközy, and E. Szemerédi, Blow-up lemma, Combin 17 (1997), 109-123.
4. J. Komlós, G. N. Sárközy, and E. Szemerédi, An algorithmic version of the blow-up lemma, Rand Struct Algorithm 12 (1998), 297-312.
5. L. Ng and M. Schultz, k-ordered Hamiltonian graphs, J Graph Theory 24 (1997), 45-57.