7 citations · 33 across the 17 of their papers we have counts for
1 paper · 2 filters
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…