Properly colored Hamilton cycles in edge colored complete graphs

Gutin, Gregory and Alon, N.

(1997)

Gutin, Gregory and Alon, N. (1997) Properly colored Hamilton cycles in edge colored complete graphs. Random Structures and Algorithms, 11 (2).

Our Full Text Deposits

Full text access: Open

Full Text - 147.87 KB

Links to Copies of this Item Held Elsewhere


Abstract

It is shown that, for >0 and n>n0(), any complete graph K on n vertices whose edges are colored so that no vertex is incident with more than edges of the same color contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and n any such K contains a cycle of length k in which adjacent edges have distinct colors.

Information about this Version

This is a Submitted version
This version's date is: 1997
This item is not peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/1ad106c7-3164-0e00-cbc0-468a6091875f/3/

Item TypeJournal Article
TitleProperly colored Hamilton cycles in edge colored complete graphs
AuthorsGutin, Gregory
Alon, N.
Uncontrolled KeywordsHamilton cycles, edge-colored graphs, alternating cycles, directed graphs
DepartmentsFaculty of Science\Computer Science

Identifiers

doihttp://dx.doi.org/10.1002/(SICI)1098-2418(199709)11:2<179::AID-RSA5>3.0.CO;2-P

Deposited by Research Information System (atira) on 25-Jul-2012 in Royal Holloway Research Online.Last modified on 25-Jul-2012


Details