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

J. Bang-jensen, N. Cohen, and F. Havet, Finding good 2-partitions of digraphs II. Enumerable properties. submitted, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01346079

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

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

X. Chen, X. Hu, and W. Zang, A Min-Max Theorem on Tournaments, SIAM Journal on Computing, vol.37, issue.3, pp.923-937, 2007.
DOI : 10.1137/060649987

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

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

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

V. Neumann-lara, The dichromatic number of a digraph, Journal of Combinatorial Theory, Series B, vol.33, issue.3, pp.265-270, 1982.
DOI : 10.1016/0095-8956(82)90046-6

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

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