1. Expressive power of digraph solvability;Bezem;Ann. Pure Appl. Logic,2012
2. Graph Theory;Bondy,2008
3. V. Chvátal, On the computational complexity of finding a kernel, Technical Report Centre de recherches mathématiques, Université de Montréal, CRM-300, 1973.
4. Graphes Noyau-parfaits;Duchet;Ann. Discrete Math.,1980
5. K-kernels in multipartite tournaments;Galeana-Sánchez;AKCE Int. J. Graphs Comb.,2011