A. Abouelaoualim, C. Das, W. Fernandez-de-la, . Vega, Y. Karpinski et al., Cycles and paths in edge-colored graphs with given degrees, Journal of Graph Theory, vol.5, issue.166, pp.63-86, 2010.
DOI : 10.1002/jgt.20440

A. Abouelaoualim, Exploration des graphes arêtes-colorées : topologie, algorithmes, complexité et (non)-approximabilité, 2007.

R. Agueda, V. Borozan, M. Groshaus, Y. Manoussakis, G. Mendy et al., Proper hamiltonian paths in edge-colored multigraphs
URL : https://hal.archives-ouvertes.fr/hal-00847916

M. Andrews and L. Zhang, Hardness of the undirected edge-disjoint paths problem, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp.276-283, 2005.

J. Bang-jensen and G. Gutin, Digraphs Theory, Algorithms and Applications, 2007.

J. M. Becu, M. Dah, Y. Manoussakis, and G. Mendy, Links in edge-colored graphs, European Journal of Combinatorics, vol.31, issue.2, pp.442-460, 2010.
DOI : 10.1016/j.ejc.2009.03.021

B. Bollobás and A. Thomason, Highly linked graphs, Combinatorica, vol.11, issue.3, pp.313-320, 1996.
DOI : 10.1007/BF01261316

J. A. Bondy and U. S. Murty, Graph Theory With Applications, 1976.
DOI : 10.1007/978-1-349-03521-2

A. Z. Broder, A. M. Frieze, S. Suen, and E. Upfal, Optimal Construction of Edge-Disjoint Paths in Random Graphs, Symposium on Discrete Algorithms, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, pp.603-612, 1994.
DOI : 10.1137/S0097539795290805

A. Z. Broder, A. M. Frieze, and E. Upfal, Existence and construction of edge disjoint paths on expander graphs, Proceedings of the 24'th annual ACM symposium on Theory of computing, pp.140-149, 1992.

C. Chekuri and S. Khanna, Edge-disjoint paths revisited, Proceedings of 45th Annual Symposium on Foundations of Computer Science, pp.115-124, 2004.
DOI : 10.1145/1290672.1290683

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.6292

W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, and Z. , Tuza and. Paths through fixed vertices in edge-colored graphs, Mathématiques et sciences humaines, vol.127, pp.49-58, 1994.

S. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

S. Even, A. Itai, and A. Shamir, On the Complexity of Timetable and Multicommodity Flow Problems, SIAM Journal on Computing, vol.5, issue.4, pp.691-703, 1976.
DOI : 10.1137/0205048

S. Fortune, J. E. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980.
DOI : 10.1016/0304-3975(80)90009-2

R. J. Gould, A. V. Kostochka, and G. Yu, On Minimum Degree Implying That a Graph is H???Linked, SIAM Journal on Discrete Mathematics, vol.20, issue.4, pp.829-840, 2006.
DOI : 10.1137/050624662

V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, Proceedings of 31st STOC, pp.19-28, 1999.

G. Gutin and E. J. Kim, Properly Coloured Cycles and Paths: Results and Open Problems, pp.200-208, 2009.
DOI : 10.1006/jctb.1997.1728

URL : http://arxiv.org/abs/0805.3901

T. C. Hu and Y. S. Kuo, Graph folding and programmable logical arrays. Networks, pp.19-37, 1987.
DOI : 10.1002/net.3230170103

K. Ichi, K. , and A. Kostochka, On sufficient degree conditions for a graph to be k-linked, Combinatorics, Probability and Computing, vol.15, issue.5, pp.685-694, 2006.

K. Ichi, K. , and B. A. Reed, Highly parity linked graphs, Combinatorica, vol.29, issue.2, pp.215-225, 2009.

R. Jose, M. X. Correa, and . Goemans, An approximate konig's theorem for edge-coloring weighted bipartite graphs, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, 2004.

M. Kano and X. Li, Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey, Graphs and Combinatorics, vol.24, issue.4, pp.237-263, 2008.
DOI : 10.1007/s00373-008-0789-5

R. M. Karp, Reducibility among combinatorial problems Complexity of Computer Computation, pp.85-104, 1972.

R. M. Karp, On the computational complexity of combinatorial problems . Networks, pp.45-68, 1975.

J. Kleinberg, Approximations algorithms for disjoint paths problem, 1996.

J. Kleinberg, An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.627-636, 2005.
DOI : 10.1109/SFCS.2005.18

J. Kleinberg and . Tardos, Disjoint paths in densely embedded graphs, 36th Annual Symposium on Foundations of Computer Science, pp.52-61, 1995.

J. Kleinberg and . Tardos, Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks, Journal of Computer and System Sciences, vol.57, issue.1, pp.61-73, 1998.
DOI : 10.1006/jcss.1998.1579

Y. Manoussakis, Alternating paths in edge-colored complete graphs, Discrete Applied Mathematics, vol.56, issue.2-3, pp.297-309, 1995.
DOI : 10.1016/0166-218X(94)00091-Q

Y. Perl and Y. Shiloach, Finding two disjoint paths between two pairs of vertices in a graph, Journal of the ACM, vol.25, issue.1, pp.1-9, 1978.

P. A. Pevzner, DNA physical mapping and alternating Eulerian cycles in colored graphs, Algorithmica, vol.14, issue.1-2, pp.77-105, 1995.
DOI : 10.1007/BF01188582

P. A. Pevzner, Computational Molecular Biology : An Algorithmic Approach The, 2000.

R. Agueda, V. Borozan, Y. Manoussakis, G. Mendy, and R. Muthu, Sufficient conditions for the existence of spanning colored trees in edgecolored graphs, 2010.

N. Robertson and P. D. Seymour, Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995.
DOI : 10.1006/jctb.1995.1006

URL : http://doi.org/10.1006/jctb.1999.1919

P. D. Seymour, Disjoint paths in graphs, Discrete Mathematics, vol.29, issue.3, pp.293-309, 1980.
DOI : 10.1016/0012-365X(80)90158-2

Y. Shiloach, A Polynomial Solution to the Undirected Two Paths Problem, Journal of the ACM, vol.27, issue.3, pp.445-456, 1980.
DOI : 10.1145/322203.322207

P. Wollan, Extremal Functions for Graph Linkages and Rooted Minors, 2005.

A. Yeo, A Note on Alternating Cycles in Edge-Coloured Graphs, Journal of Combinatorial Theory, Series B, vol.69, issue.2, pp.222-225, 1997.
DOI : 10.1006/jctb.1997.1728