Wahlström, Magnus Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Wahlström, M. (2011). New Plain-exponential Time Classes for Graph Homomorphism. Theory of Computing Systems, 49(2), 273-282. doi:10.1007/s00224-010-9261-z.