Title of article :
Color the cycles
Author/Authors :
Katona، نويسنده , , Gyula O.H. and Tuza، نويسنده , , Zsolt، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2013
Abstract :
The cycles of length k in a complete graph on n vertices are colored in such a way that edge-disjoint cycles get distinct colors. The minimum number of colors is asymptotically determined.
Keywords :
cycle , Coloring , Turلn type problem
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
