1. Abello, J., Fellows, M.R., Stillwell, J.C.: On the complexity and combinatorics of covering finite complexes. Aust. J. Comb. 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. ACM, New York (1980)
3. Bodlaender, H.L.: The classification of coverings of processor networks. J. Parallel Distrib. Comput. 6, 166–182 (1989)
4. Bok, J., Fiala, J., Hliněný, P., Jedličková, N., Kratochvíl, J.: Computational complexity of covering multigraphs with semi-edges: small cases. In: Bonchi, F., Puglisi, S. J. (eds.), MFCS 2021, LIPIcs, vol. 202, pp. 21:1–21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
5. Lecture Notes in Computer Science;J Bok,2021