| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647470 | Discrete Mathematics | 2013 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gyula O.H. Katona, Zsolt Tuza,