[3] J. Bang-Jensen and G.Z. Gutin, Digraphs: Theory, Algorithms and Applications, Springer Science & Business Media,
2009.
[4] J. Bang-Jensen and G.Z. Gutin, Classes of Directed Graphs, Springer Publishing Company, 2018.
[5] J. Baumgardner, K. Acker, O. Adefuye, and et al., Solving a hamiltonian path problem with a bacterial computer, J. Biol. Eng. 3 (2009), no. 1, Article number: 11.
https://doi.org/10.1186/1754-1611-3-11
[6] C. Berge and P. Duchet, Recent problems and results about kernels in directed graphs., Topics on Domination (S.T. Hedetniemi, ed.), Annals Discrete Mathematics, vol. 48, Elsevier, 1991, pp. 27–31.
[8] V. Chvátal, On the computational complexity of finding a kernel, Tech. report, Report CRM-300, Centre de Recherches Mathématiques, Université de Montr´eal, 1973.
[12] H. Galeana-Sánchez and V. Neumann-Lara, New classes of critical kernel-imperfect digraphs, Discuss. Math. Graph
Theory 18 (1998), no. 1, 85–89.
[13] P. Hell and C. Hernández-Cruz, On the complexity of the 3-kernel problem in some classes of digraphs, Discuss. Math. Graph Theory 34 (2014), no. 1, 167–185.
https://doi.org/10.7151/dmgt.1727
[14] E. J. Kim and R. Williams, Improved parameterized algorithms for above average constraint satisfaction, Parameterized and Exact Computation (Berlin, Heidelberg) (D. Marx and P. Rossmanith, eds.), Springer Berlin Heidelberg, 2012, pp. 118–131.
[16] J.M. Le Bars, Counterexamples of the 0-1 law for fragments of existential second-order logic: an overview, Bull. Symb. Log. 6 (2000), no. 1, 67–82.
https://doi.org/10.2307/421076
[17] J.M. Le Bars, The 0-1 law fails for frame satisfiability of propositional modal logic, Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (USA), IEEE Computer Society, 2002, pp. 225–234.
[18] S.C. Locke and D. Witte, On non-Hamiltonian circulant digraphs of outdegree three, J. Graph Theory 30 (1999), no. 4, 319–331.
[19] J.V. Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, 1944.