research

Color the cycles

Authors
Publication date
1 January 2013
Publisher
'Elsevier BV'
Doi

    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. © 2013

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Repository of the Academy's Library

      redirect
      oaioai:real.mtak.hu:7990
      Last time updated on 12/12/2013

      Crossref

      redirect
      oaiinfo:doi/10.1016%2Fj.disc.2013...
      Last time updated on 05/01/2021