V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano, Randomized path coloring on binary trees, Proc. of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (AP- PROX'00), pp.60-71, 1913.

B. Beauquier, Communications dans les réseaux optiques par multiplexage en longueur d'onde, 2000.

. Bgp-+-96-]-j-c, L. Bermond, S. Gargano, A. A. Pérennes, U. Rescigno et al., Efficient collective communication in optical networks, Proc. of the 23rd International Colloquium on Automata, Languages and Programming (ICALP'96), pp.574-585, 1996.

I. Chlamtac, A. Ganz, and G. Karmi, Lightpath communications: an approach to high bandwidth optical WAN's, IEEE Transactions on Communications, vol.40, issue.7, pp.1171-1182, 1992.
DOI : 10.1109/26.153361

. Ejk-+-99-]-t, K. Erlebach, C. Jansen, M. Kaklamanis, P. Mihail et al., Optimal wavelength routing on directed fiber trees, Theoretical Computer Science, vol.221, issue.12, pp.119-137, 1999.

N. Garg, Multicommodity Flows and Approximation Algorithms, 1994.

L. Gargano, P. Hell, and S. Pérennes, Colouring paths in directed symmetric trees with applications to WDM routing, Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), pp.505-515, 1997.
DOI : 10.1007/3-540-63165-8_206

M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.2, issue.2, pp.169-197, 1981.
DOI : 10.1007/BF02579273

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1993.

I. A. Karapetian, On coloring of arc graphs. Doklady Akad, Nauk Armianskoi CCP, vol.70, issue.5, pp.306-311, 1980.

V. Kumar, Approximating circular arc colouring and bandwidth allocation in all-optical ring networks, Proc. of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'98, 1998.
DOI : 10.1007/BFb0053971

T. Niessen and J. Kind, The round-up property of the fractional chromatic number for proper circular arc graphs, Journal of Graph Theory, 1998.

R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, pp.221-232, 1985.
DOI : 10.1016/0012-365X(85)90051-2
URL : http://doi.org/10.1016/0012-365x(85)90051-2

A. Tucker, Coloring a Family of Circular Arcs, SIAM Journal on Applied Mathematics, vol.29, issue.3, pp.493-502, 1975.
DOI : 10.1137/0129040