J. Araujo, N. Cohen, F. Giroire, and F. Havet, Good edge-labelling of graphs, Discrete Applied Mathematics, vol.160, issue.18, 2011.
DOI : 10.1016/j.dam.2011.07.021
URL : https://hal.archives-ouvertes.fr/inria-00383343

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

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

M. Bode, B. Farzad, and D. O. Theis, Good edge-labelings and graphs with girth at least five, 2011.

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

O. Durand-de-gevigney, F. Meunier, C. Popa, J. Reygner, and A. Romero, Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree, 4OR, vol.55, issue.2, pp.175-188, 2011.
DOI : 10.1007/s10288-010-0150-8
URL : https://hal.archives-ouvertes.fr/hal-00676432

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

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