J. Bermond and S. Ceroi, Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. Networks, pp.83-86, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00071959

J. Bermond, C. J. Colbourn, D. Coudert, G. Ge, A. C. Ling et al., = 6, SIAM Journal on Discrete Mathematics, vol.19, issue.2, pp.523-542, 2005.
DOI : 10.1137/S0895480104444314

J. Bermond, C. J. Colbourn, A. C. Ling, and M. L. Yu, Grooming in unidirectional rings: K4???e designs, Discrete Mathematics, vol.284, issue.1-3, pp.67-72, 2004.
DOI : 10.1016/j.disc.2003.11.023
URL : https://hal.archives-ouvertes.fr/inria-00505518

J. Bermond and D. Coudert, Traffic grooming in unidirectional WDM ring networks using design theory, IEEE International Conference on Communications, 2003. ICC '03., pp.1402-1406, 2003.
DOI : 10.1109/ICC.2003.1204621
URL : https://hal.archives-ouvertes.fr/inria-00429174

J. Bermond and D. Coudert, The CRC Handbook of Combinatorial Designs, Discrete Mathematics and Its Applications Grooming C. J. Colbourn and J. H, vol.42, issue.27, pp.493-496, 2006.

J. Bermond, D. Coudert, and X. Muñoz, Traffic Grooming in Unidirectional WDM Ring Networks : the all-to-all unitary case, ONDM'03 : 7th IFIP Working Conference on Optical Network Design and Modelling, pp.1135-1153, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00429175

C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau et al., Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic, IEEE J. on Selected Areas in Comm, vol.18, issue.7, pp.1961-1971, 2000.

D. Bryant, P. Adams, and M. Buchanan, A survey on the existence of G-designs, J. Combinatorial Designs, vol.16, pp.373-410, 2008.

Y. Caro and J. Schönheim, Decompositions of trees into isomorphic subtrees, Ars Combininatorica, vol.9, pp.119-130, 1980.
DOI : 10.1002/jgt.3190080404

C. J. Colbourn and J. H. Dinitz, Handbook of combinatorial designs, 2007.
DOI : 10.1201/9781420049954

C. J. Colbourn, H. L. Fu, G. Ge, A. C. Ling, and H. C. Lu, Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven, SIAM Journal on Discrete Mathematics, vol.23, issue.1, pp.109-122, 2008.
DOI : 10.1137/070709141

C. J. Colbourn, A. C. Ling, and G. Quattrocchi, Minimum embedding of P3-designs into (K4?e)-designs, Journal of Combinatorial Designs, vol.122, issue.209, pp.352-366, 2003.
DOI : 10.1002/jcd.10044

C. J. Colbourn, G. Quattrocchi, and V. R. Syrotiuk, Grooming for two-period optical networks, Networks, vol.8, issue.4, pp.307-324, 2008.
DOI : 10.1002/net.20252
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.492.6043

C. J. Colbourn, G. Quattrocchi, and V. R. Syrotiuk, Lower bounds for graph decompositions via linear programming duality, Networks, vol.58, pp.299-306, 2008.
DOI : 10.1002/net.20251
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.497.5185

C. J. Colbourn and A. Rosa, Quadratic leaves of maximal partial triple systems, Graphs and Combinatorics, vol.17, issue.1, pp.317-337, 1986.
DOI : 10.1007/BF01788106

C. J. Colbourn and A. Rosa, Triple systems, 1999.

D. De-werra, Equitable colorations of graphs. RAIRO R-3, pp.3-8, 1971.

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

H. L. Fu and C. A. Rodger, Forest leaves and four-cycles, Journal of Graph Theory, vol.30, issue.3, pp.161-166, 2000.
DOI : 10.1002/(SICI)1097-0118(200003)33:3<161::AID-JGT6>3.0.CO;2-Q

O. Goldschmidt, D. Hochbaum, A. Levin, and E. Olinick, The SONET edge-partition problem, Networks, vol.46, issue.1, pp.13-23, 2003.
DOI : 10.1002/net.10054

J. Hu, Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic, OSA Journal of Optical Networks, vol.1, issue.1, pp.32-42, 2002.

E. Modiano and P. Lin, Traffic grooming in WDM networks, IEEE Communications Magazine, vol.39, issue.7, pp.124-129, 2001.
DOI : 10.1109/35.933446

X. Muñoz and I. Sau, Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph, WG'08 : 34th International Workshop on Graph-Theoretic Concepts in Computer Science, 2008.

M. Plantholt, The chromatic index of graphs with a spanning star, Journal of Graph Theory, vol.3, issue.1, pp.45-53, 1981.
DOI : 10.1002/jgt.3190050103

G. Quattrocchi, Embedding path designs in 4-cycle systems, Discrete Mathematics, vol.255, issue.1-3, pp.349-356, 2002.
DOI : 10.1016/S0012-365X(01)00410-1
URL : http://doi.org/10.1016/s0012-365x(01)00410-1

A. Rosa and W. D. Wallis, Premature sets of 1-factors or how not to schedule round robin tournaments, Discrete Applied Mathematics, vol.4, issue.4, pp.291-297, 1982.
DOI : 10.1016/0166-218X(82)90051-8

J. Simmons, E. Goldstein, and A. Saleh, Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic, Journal of Lightwave Technology, vol.17, issue.1, pp.48-57, 1999.
DOI : 10.1109/50.737421

E. B. Yavorskii, Representations of directed graphs and ?-transformations. Theoretical and Applied Questions of Differential Equations and Algebra, pp.247-250, 1978.

K. Zhu and B. Mukherjee, A review of traffic grooming in WDM optical networks : Architectures and challenges. Optical Networks Magazine, pp.55-64, 2003.

K. Zhu, H. Zhu, and B. Mukherjee, Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming, IEEE Network, pp.8-15, 2003.

M. On, (5 + i, 4 + i, 1 + i; a 1 ) | i = 0 + i, 5 + i, 4 + i; a 0 ) | i = 10, 11, 12} ? {(3 + i, 1 + i, 9 + i; a 2 ) | i = 6, 7, . . . , 12} ? {(9 + i, 1 + i, 3 + i; a 0 ) | i = 1, 10)}, where the sums are computed modulo 13

M. On, 10, 7; a 3 ), (1, 3, 14, 2001.

I. Unité-de-recherche-inria-sophia and . Antipolis, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex (France) Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint, Ismier (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex, 2004.

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399