Revisiting Tucker's algorithm to color circular arc graphs

SIAM Journal on Computing

Volumn 32, Issue 4, 2003, Pages 1067-1072

  Valencia Pabon, Mario ^a  

^a UNIVERSIDAD DE LOS ANDES   (Colombia)

Author keywords

Chromatic number; Circular arc graphs; Graph algorithms; Induced cycles

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; PROBLEM SOLVING;

GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 0141534101     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700382157     Document Type: Article

References (9)

1. M. R. GAREY, D. S. JOHNSON, G. L. MILLER, AND C. H. PAPADIMITRIOU, The complexity of coloring circular arcs and chords, SIAM J. Alg. Disc. Meth., 1 (1980), pp. 216-227.
2. L. GARGANO AND A. RESCIGNO, Coloring circular arcs with applications to WDM routing, in Proceedings of the Workshop on Approximation and Randomization Algorithms in Communication Networks, Geneva, Switzerland, 2000.
3. F. GAVRIL, Intersection graphs of Helly families of subtrees, Discrete Appl. Math., 66 (1996), pp. 45-56.
4. I. A. KARAPETYAN, Coloring of arc graphs, Akad. Nauk Armyan. SSR Dokl., 70 (1980), pp. 306-311 (in Russian).
5. V. KUMAR, An approximation algorithm for circular arc coloring, Algorithmica, 30 (2001), pp. 406-417.
6. 2) algorithm for coloring proper circular arc graphs, SIAM J. Alg. Disc. Meth., 2 (1981), pp. 88-93.
7. 1.5) algorithm to color proper circular arcs, Discrete Appl. Math., 25 (1989), pp. 321-323.
8. S. STAHL, n-tuple colorings and associated graphs, J. Combinatorial Theory Ser. B, 20 (1976), pp. 185-203.
9. A. TUCKER, Coloring a family of circular arcs, SIAM J. Appl. Math., 29 (1975), pp. 493-502.