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

J. Bang-jensen, M. Hegner-nielsen, and A. Yeo, Longest path partitions in generalizations of tournaments, Discrete Mathematics, vol.306, issue.16, pp.1830-1839, 2006.
DOI : 10.1016/j.disc.2006.03.063

C. C. Chen and P. Manalastas-jr, Every finite strongly connected digraph of stability 2 has a Hamiltonian path, Discrete Mathematics, vol.44, issue.3, pp.243-250, 1983.
DOI : 10.1016/0012-365X(83)90188-7

M. Frick, S. Van-aardt, G. Dlamini, J. Dunbar, and O. Oellermann, The directed path partition conjecture, Discuss. Math. Graph Theory, vol.25, pp.331-343, 2005.

M. Frick, S. A. Van-aardt, M. H. Nielsen, O. Oellermann, and J. E. Dunbar, A Traceability conjecture for oriented graphs

M. Grötschel, C. Thomassen, Y. Wakabayashi, and H. Digraphs, Hypotraceable digraphs, Journal of Graph Theory, vol.14, issue.4, pp.377-381, 1980.
DOI : 10.1002/jgt.3190040406

J. M. Laborde, C. Payan, and N. H. Xuong, Independent sets and longest directed paths in digraphs, Graphs and other combinatorial topics, pp.173-177, 1982.

C. Thomassen, Hypohamiltonian graphs and digraphs, Theory and Applications of graphs, pp.557-571, 1976.
DOI : 10.1007/BFb0070410

C. A. Whitehead, M. Frick, and S. A. Van-aardt, Significant differences between path partitions in directed and undirected graphs