N. Alon, Splitting digraphs, Combinatorics, Probability and Computing, vol.15, issue.06, pp.933-937, 2006.
DOI : 10.1017/S0963548306008042

J. Bang-jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, 2009.
DOI : 10.1007/978-1-84800-998-1

J. Bang-jensen and F. Havet, Finding good 2-partitions of digraphs I. Hereditary properties, Theoretical Computer Science, vol.636, 2016.
DOI : 10.1016/j.tcs.2016.05.029
URL : https://hal.archives-ouvertes.fr/hal-01327015

J. Bang-jensen, F. Havet, A. K. Maia, and . Oliveira, Finding a subdivision of a digraph, Theoretical Computer Science, vol.562, p.20, 2015.
DOI : 10.1016/j.tcs.2014.10.004
URL : https://hal.archives-ouvertes.fr/hal-00720500

J. Bang-jensen and M. Kriesell, On the problem of finding disjoint cycles and dicycles in a digraph, Combinatorica, vol.55, issue.49, pp.639-638, 2011.
DOI : 10.1007/s00493-011-2670-z

J. Bang-jensen, M. Kriesell, S. A. Maddaloni, and . Simonsen, Vertex-disjoint directed and undirected cycles in general digraphs, Journal of Combinatorial Theory, Series B, vol.106, pp.1-14, 2014.
DOI : 10.1016/j.jctb.2013.10.005

J. Bang-jensen and A. Yeo, Arc-disjoint spanning sub(di)graphs in digraphs, Theoretical Computer Science, vol.438, pp.48-54, 2012.
DOI : 10.1016/j.tcs.2012.03.003

J. Bensmail, On the complexity of partitioning a graph into a few connected subgraphs, Journal of Combinatorial Optimization, vol.24, issue.2, pp.174-187, 2015.
DOI : 10.1007/s10878-013-9642-8
URL : https://hal.archives-ouvertes.fr/hal-00762612

D. Bokal, G. Fijavz, M. Juvan, P. M. Kayl, and B. Mohar, The circular chromatic number of a digraph, Journal of Graph Theory, vol.229, issue.3, pp.227-240, 2004.
DOI : 10.1002/jgt.20003

D. Concalves, F. Havet, S. A. Pinlou, and . Thomassé, On spanning galaxies in digraphs, Discrete Applied Mathematics, vol.160, issue.6, pp.744-754, 2012.
DOI : 10.1016/j.dam.2011.07.013

L. Cowen, W. Goddard, and C. E. Jesurum, Defective coloring revisited, Journal of Graph Theory, vol.24, issue.3, pp.205-219, 1997.
DOI : 10.1002/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1032.4522

M. E. Dyer and A. M. Frieze, On the complexity of partitioning graphs into connected subgraphs, Discrete Applied Mathematics, vol.10, issue.2, pp.139-153, 1985.
DOI : 10.1016/0166-218X(85)90008-3

S. Földes and P. Hammer, Split graphs, Congressus Numerantium, vol.19, pp.311-315, 1977.

A. Grigoriev and R. Sitters, Connected Feedback Vertex Set in Planar Graphs, Lecture Notes in Comp. Science, vol.5911, pp.143-153, 2009.
DOI : 10.1007/978-3-642-11409-0_13

K. Kawarabayashi and S. Kreutzer, The directed grid theorem. CoRR, abs, 1411.

D. Kühn and D. Osthus, Partitions of graphs with high minimum degree or connectivity, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.29-43, 2003.
DOI : 10.1016/S0095-8956(03)00028-5

D. Kühn, D. Osthus, and T. Townsend, Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths, Combinatorica, vol.7, issue.4
DOI : 10.1007/s00493-015-3186-8

H. Le, V. B. Le, and H. Müller, Splitting a graph into disjoint induced paths or cycles, Discrete Applied Mathematics, vol.131, issue.1, pp.199-212, 2003.
DOI : 10.1016/S0166-218X(02)00425-0

M. Liu and B. Xu, Bipartition of graph under degree constraints, Science China Mathematics, vol.106, issue.4, pp.869-874, 2015.
DOI : 10.1007/s11425-014-4915-y

W. Mccuaig, Intercyclic digraphs, Graph structure theory, pp.203-245, 1991.
DOI : 10.1090/conm/147/01176

N. Misra, G. Philip, V. Raman, S. Saurabh, and S. Sikdar, FPT algorithms for Connected Feedback Vertex Set, Journal of Combinatorial Optimization, vol.43, issue.2, pp.131-146, 2012.
DOI : 10.1007/s10878-011-9394-2

K. B. Reidburnaby and B. C. , Two complementary circuits in two-connected tournaments, Cycles in graphs, pp.321-334, 1982.

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350

M. Stiebitz, Decomposition of graphs and digraphs, KAM Series in Discrete Mathematics- Combinatorics-Operations Research-Optimization 95-309, 1995.

H. Suzuki, N. Takahashi, and T. Nishizeki, A linear algorithm for bipartition of biconnected graphs, Information Processing Letters, vol.33, issue.5, pp.227-231, 1990.
DOI : 10.1016/0020-0190(90)90189-5

C. Thomassen, Graph decomposition with constraints on the connectivity and minimum degree, Journal of Graph Theory, vol.5, issue.2, pp.165-167, 1983.
DOI : 10.1002/jgt.3190070204

C. Thomassen, Even Cycles in Directed Graphs, European Journal of Combinatorics, vol.6, issue.1, pp.85-89, 1985.
DOI : 10.1016/S0195-6698(85)80025-1

P. Van-'t-hof, D. Paulusma, and G. J. Woeginger, Partitioning graphs into connected parts, Theoretical Computer Science, vol.410, pp.4834-4843, 2009.