If the edges of a finite complete graph K are colored with r colors then the vertex set of K can be covered by at most cr2log r vertex disjoint monochromatic cycles. Several related problems are discussed.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics