1. Abello, J., Fellows, M.R., Stillwell, J.C.: On the complexity and combinatorics of covering finite complexes. Aust. J. Combin. 4, 103–112 (1991)
2. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82–93 (1980)
3. Bard, S., Bellitto, T., Duffy, C., MacGillivray, G., Yang, F.: Complexity of locally-injective homomorphisms to tournaments. Discret. Math. Theor. Comput. Sci. 20(2) (2018). http://dmtcs.episciences.org/4999
4. Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)
5. Lecture Notes in Computer Science;O Bílka,2011