Computational complexity of covering three-vertex multigraphs
From MaRDI portal
Publication:897866
DOI10.1016/j.tcs.2015.09.013zbMath1331.68108MaRDI QIDQ897866
Jan Kratochvíl, Jan Arne Telle, Marek Tesař
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.013
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Coverings and minors: Application to local computations in graphs
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- The NP-Completeness of Edge-Coloring
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- On possible counterexamples to Negami's planar cover conjecture
- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
- The complexity of satisfiability problems
- An Efficient Algorithm for Graph Isomorphism
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
