Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles

Ars Combinatoria

Volumn 50, Issue , 1998, Pages 316-318

  Barr, Olof ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (8)

1. N. Alon and G. Gutin, Properly colored Hamilton cycles in edge colored complete graphs. Submitted.
2. J. Bang-Jensen and G. Gutin, Alternating cycles and paths in edge-coloured multigraphs: a survey, (to appear in Discrete Math.).
3. M. Bankfalvi and Zs. Bankfalvi: Alternating Hamiltonian Circuits in Two-coloured Complete Graphs, in: "Theory of Graphs" (Proc. Colloq., Tihany, 1966), Academic Press, New York, 1968, 11-18.
4. B. Bollobás and P. Erdos, Alternating Hamiltonian Cycles, Israel J. Math. 23 (1976), 126-131.
5. C.C. Chen and D.E. Daykin, Graphs with Hamilton cycles having adjacent lines in different colors, J. Combin. Th. Ser. B 21 (1976), 135-139.
6. D.E. Daykin, Graphs with cycles having adjacent lines in different colors, J. Comb. Ser. B 20 (1976), 149-152.
7. R. Saad, Sur quelques problèmes de complexité dans les graphs, Ph.D thesis, U. de Paris-Sud, Orsay (1992).
8. J. Shearer, A property of the colored complete graph, Discrete Math. 25 (1979), 175-178.