J. Araujo, N. Cohen, F. Giroire, and F. Havet, Good edge-labelling of graphs, proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09), Electronic Notes in Discrete Mathematics, 2009.
DOI : 10.1016/j.dam.2011.07.021
URL : https://hal.archives-ouvertes.fr/inria-00639005

B. Beauquier, J. Bermond, L. Gargano, P. Hell, S. Pérennes et al., Graph problems arising from wavelength-routing in all-optical networks, IEEE Workshop on Optics and Computer Science, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00073523

B. Beauquier, P. Hell, and S. Pérennes, Optimal wavelength-routed multicasting, Discrete Applied Mathematics, vol.84, issue.1-3, pp.15-20, 1998.
DOI : 10.1016/S0166-218X(97)00137-6
URL : https://hal.archives-ouvertes.fr/inria-00073413

J. Bermond, L. Braud, and D. Coudert, Traffic grooming on the path, Theoretical Computer Science, vol.384, issue.2-3, pp.139-151, 2007.
DOI : 10.1016/j.tcs.2007.04.028
URL : https://hal.archives-ouvertes.fr/inria-00070363

J. Bermond and M. Cosnard, Minimum number of wavelengths equals load in a DAG without internal cycle, 2007 IEEE International Parallel and Distributed Processing Symposium, pp.1-10, 2007.
DOI : 10.1109/IPDPS.2007.370244
URL : https://hal.archives-ouvertes.fr/hal-00512284

J. Bermond, M. Cosnard, D. Coudert, and S. Pérennes, Optimal Solution of the Maximum All Request Path Grooming Problem, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06), 2006.
DOI : 10.1109/AICT-ICIW.2006.144
URL : https://hal.archives-ouvertes.fr/inria-00070381

B. Bollobas, Chromatic number, girth and maximal degree, Discrete Mathematics, vol.24, issue.3, pp.311-314, 1978.
DOI : 10.1016/0012-365X(78)90102-4

I. Caragiannis, C. Kaklamanis, and P. Persiano, Wavelength routing in all-optical tree networks: A survey, Computers and Artificial Intelligence, vol.20, issue.2, pp.95-120, 2001.

R. Dutta and N. Rouskas, A survey of virtual topology design algorithms for wavelength routed optical networks, Optical Networks Magazine, vol.1, issue.1, pp.73-89, 2000.

R. Dutta and N. Rouskas, Traffic grooming in WDM networks: past and future, IEEE Network, vol.16, issue.6, pp.46-56, 2002.
DOI : 10.1109/MNET.2002.1081765

T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano, Optimal wavelength routing on directed fiber trees, Theoretical Computer Science, vol.221, issue.1-2, pp.119-137, 1999.
DOI : 10.1016/S0304-3975(99)00029-8

L. Gargano, P. Hell, and S. Pérennes, Coloring all directed paths in a symmetric tree, with an application to optical networks, Journal of Graph Theory, vol.26, issue.4, pp.183-196, 2001.
DOI : 10.1002/jgt.10002

J. Kleinberg and A. Kumar, Wavelength Conversion in Optical Networks, Proceedings of SODA'99, pp.566-575, 1999.
DOI : 10.1006/jagm.2000.1137

F. Meunier, C. Popa, and A. Romero, Directed paths on a tree: coloring and multicut. submitted, 2008.

C. L. Monma and V. K. Wei, Intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.141-181, 1986.
DOI : 10.1016/0095-8956(86)90042-0

B. Mukherjee, Optical communication networks, 1997.

J. Nesetril and V. , A short proof of the existence of highly chromatic hypergraphs without short cycles, Journal of Combinatorial Theory, Series B, vol.27, issue.2, pp.225-227, 2001.
DOI : 10.1016/0095-8956(79)90084-4

R. Ramaswami and K. N. Sivajaran, Routing and wavelength assignment in all-optical networks, IEEE/ACM Transactions on Networking, vol.3, issue.5, pp.489-500, 1995.
DOI : 10.1109/90.469957

R. Ramaswami and K. N. Sivajaran, Optical networks : a practical perspective, 1998.