1. On kernels in strongly connected graphs;Anciaux-Mendeleer;Networks,1977
2. Perfect graphs, kernels and cooperative games;Boros;Discrete Mathematics,2006
3. Vašek Chvátal, On the computational complexity of finding a kernel, Technical Report CRM-300, Centre de Recherches Mathématiques, Université de Montréal, 1973. http://users.encs.concordia.ca/~chvatal.
4. Patterns of paradox;Cook;The Journal of Symbolic Logic,2004
5. The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness;Creignou;Theoretical Computer Science,1995