P. Duchet, Representation; noyaux en theorie des graphes et hypergraphes, 1979.

P. Duchet and H. , Une généralisation du théorème de Richardson noyaux dans le graphes orientés, Discrete Math, pp.43-64, 1983.
DOI : 10.1016/0012-365x(83)90017-1
URL : http://doi.org/10.1016/0012-365x(83)90017-1

H. Galeana-sánchez, Kernels in digraphs with covering number at most 3, Discrete Math, pp.121-135, 2002.

H. Galeana-sánchez, Semikernels modulo F and kernels in digraphs, Discrete Mathematics, vol.218, issue.1-3, pp.61-71, 2000.
DOI : 10.1016/S0012-365X(99)00336-2

H. Galeana-sánchez and V. Neumann-lara, )-Kernels in Digraphs, SIAM Journal on Discrete Mathematics, vol.11, issue.2, pp.67-76, 1984.
DOI : 10.1137/S0895480195291370

M. Richardson, On weakly ordered systems, Bulletin of the American Mathematical Society, vol.52, issue.2, p.113, 1946.
DOI : 10.1090/S0002-9904-1946-08518-3

B. Sands, N. Sauer, and R. Woodrow, On monochromatic paths in edge-coloured digraphs, Journal of Combinatorial Theory, Series B, vol.33, issue.3, pp.271-275, 1982.
DOI : 10.1016/0095-8956(82)90047-8

J. , V. Neumann, and O. Morgenstern, Theory of Games and Economic Behavior, 1944.