View in EDS

Computational complexity of covering coloured mixed multigraphs with simple degree partitions.

Saved in:
Bibliographic Details
Title: Computational complexity of covering coloured mixed multigraphs with simple degree partitions.
Authors: Bok, Jan1,2 (AUTHOR) jan.bok@matfyz.cuni.cz, Fiala, Jiří1,3 (AUTHOR) fiala@kam.mff.cuni.cz, Jedličková, Nikola1,3 (AUTHOR) jedlickova@kam.mff.cuni.cz, Kratochvíl, Jan1,3 (AUTHOR) honza@kam.mff.cuni.cz, Seifrtová, Michaela1,3 (AUTHOR) michaela.seifrtova@mff.cuni.cz
Source: Discrete Applied Mathematics. May2026, Vol. 385, p194-221. 28p.
Subjects: Computational complexity, Multigraph, NP-hard problems, Graph theory
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 coloured 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. In particular, we consider graphs that 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-complete 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. [ABSTRACT FROM AUTHOR]
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
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 coloured 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. In particular, we consider graphs that 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-complete 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. [ABSTRACT FROM AUTHOR]
ISSN:0166218X
DOI:10.1016/j.dam.2026.01.019