Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges

Jan Bok, Jiří Fiala, Petr Hliněný +2

We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a…