Properly colored Hamilton cycles in edge-colored complete graphs

Random Structures and Algorithms

Volumn 11, Issue 2, 1997, Pages 179-186

  Alon, N ^a   Gutin, G ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Alternating cycles; Directed graphs; Edge colored graphs; Hamilton cycles

Indexed keywords

EID: 0031476853     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-P     Document Type: Article

References (10)

1. N. Alon, The strong chromatic number of a graph, Random Struct. Alg., 3, 1-7 (1992).
2. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
3. J. Bang-Jensen and G. Gutin, Alternating cycles and paths in edge-coloured multi-graphs: a survey, Discrete Math., 165-166, 39-60 (1997).
4. J. Bang-Jensen, G. Gutin, and H. Li, Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theory, 22, 181-187 (1996).
5. C. Berge, Graphs and Hypergraphs, 2nd ed., North-Holland, Paris, 1976.
6. J.-C. Bermond and C. Thomassen, Cycles in digraphs: a survey, J. Graph Theory, 5, 1-43 (1981).
7. B. Bollobás and P. Erdos, Alternating Hamiltonian cycles, Isr. J. Math., 23, 126-131 (1976).
8. C. C. Chen and D. E. Daykin, Graphs with Hamiltonian cycles having adjacent lines different colors, J. Combinat. Theor. Ser. B, 21, 135-139 (1976).
9. V. D. Milman and G. Schechtman, Asymptotic Theory of Finite Dimensional Normed Spaces, Lecture Notes in Mathematics 1200, Springer-Verlag, Berlin and New York, 1986.
10. J. Shearer, A property of the colored complete graph, Discrete Math., 25, 175-178 (1979).