Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)

The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph H, the H-Cover problem asks if an input graph G allows a graph covering projection onto H. Despite the fact that the quest for characterizing the computational complexity of H-Cover had been started more than 30 years ago, only a handful of general results have been known so far. In this paper, we present a complete characterization of the computational complexity of covering colored graphs for the case that every equivalence class in the degree partition of the target graph has at most two vertices. We prove this result in a very general form. Following the lines of current development of topological graph theory, we study graphs in the most relaxed sense of the definition - the graphs are mixed (they may have both directed and undirected edges), may have multiple edges, loops, and semi-edges. We show that a strong P/NP-co dichotomy holds true in the sense that for each such fixed target graph H, the H-Cover problem is either polynomial time solvable for arbitrary inputs, or NP-complete even for simple input graphs.