Circular-arc Graph Coloring and Unrolling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

Circular-arc Graph Coloring and Unrolling

Christine Eisenbeis
  • Function : Author
  • PersonId : 833430
Sylvain Lelait
  • Function : Author
Bruno P Marmol


The register periodic allocation problem is viewed as unrolling and coloring the underlying structure of circular-arc graph. The problem is to find relations between the unrolling degree and the chromatic number. For this purpose we distinguish cyclic colorings that can be found by means of the {\em meeting graph} and non-cyclic ones for which we prove the asymptotic property: let $r$ be the width of the original interval family. Then the $u$-unrolled graph is $r$ or $r+1$-colorable for $u$ large enough.
Fichier principal
Vignette du fichier
RR-3336.pdf (262.8 Ko) Télécharger le fichier

Dates and versions

inria-00073353 , version 1 (24-05-2006)


  • HAL Id : inria-00073353 , version 1


Christine Eisenbeis, Sylvain Lelait, Bruno P Marmol. Circular-arc Graph Coloring and Unrolling. RR-3336, INRIA. 1998. ⟨inria-00073353⟩
457 View
753 Download


Gmail Facebook Twitter LinkedIn More