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

by   Jan Bok, et al.

We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for graphs with semi-edges. The notion of graph covering is a discretization of coverings between surfaces or topological spaces, a notion well known and deeply studied in classical topology. Graph covers have found applications in discrete mathematics for constructing highly symmetric graphs, and in computer science in the theory of local computations. In 1991, Abello et al. asked for a classification of the computational complexity of deciding if an input graph covers a fixed target graph, in the ordinary setting (of graphs with only edges). Although many general results are known, the full classification is still open. In spite of that, we propose to study the more general case of covering graphs composed of normal edges (including multiedges and loops) and so-called semi-edges. Semi-edges are becoming increasingly popular in modern topological graph theory, as well as in mathematical physics. They also naturally occur in the local computation setting, since they are lifted to matchings in the covering graph. We show that the presence of semi-edges makes the covering problem considerably harder; e.g., it is no longer sufficient to specify the vertex mapping induced by the covering, but one necessarily has to deal with the edge mapping as well. We show some solvable cases, and completely characterize the complexity of the already very nontrivial problem of covering one- and two-vertex (multi)graphs with semi-edges. Our NP-hardness results are proven for simple input graphs, and in the case of regular two-vertex target graphs, even for bipartite ones. This provides a strengthening of previously known results for covering graphs without semi-edges, and may contribute to better understanding of this notion and its complexity.


page 3

page 7

page 13

page 15

page 19

page 20

page 25

page 27


List covering of regular multigraphs

A graph covering projection, also known as a locally bijective homomorph...

Computational Complexity of Covering Disconnected Multigraphs

The notion of graph covers is a discretization of covering spaces introd...

Covering multigraphs with bipartite graphs

Hansel's lemma states that ∑_H∈ℋ|H| ≥ n log_2 n holds where ℋ is a colle...

List Locally Surjective Homomorphisms in Hereditary Graph Classes

A locally surjective homomorphism from a graph G to a graph H is an edge...

FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges

We study the α-Fixed Cardinality Graph Partitioning (α-FCGP) problem, th...

The complexity of blocking (semi)total dominating sets with edge contractions

We consider the problem of reducing the (semi)total domination number of...

Equitable Partitions into Matchings and Coverings in Mixed Graphs

Matchings and coverings are central topics in graph theory. The close re...

Please sign up or login with your details

Forgot password? Click here to reset