scientific article; zbMATH DE number 7724194
From MaRDI portal
Publication:6168434
Recommendations
- scientific article; zbMATH DE number 2081019
- Computational complexity of covering disconnected multigraphs
- scientific article; zbMATH DE number 89406
- On the complexity of planar covering of small graphs
- Complexity of graph covering problems
- scientific article; zbMATH DE number 1236360
- Computational complexity of covering three-vertex multigraphs
- Computational complexity of covering three-vertex multigraphs
- The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
- Complexity results for well‐covered graphs
Cited in
(13)- List covering of regular multigraphs
- Small \(\ell\)-edge-covers in \(k\)-connected graphs
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
- Graph covers: where topology meets computer science, and simple means difficult
- List covering of regular multigraphs with semi-edges
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- An algorithmic framework for locally constrained homomorphisms
- Computational complexity of covering disconnected multigraphs
- Computational complexity of covering coloured mixed multigraphs with simple degree partitions
- Computational complexity of covering multigraphs with semi-edges: small cases
- A novel approach to covers of multigraphs with semi-edges
- Graph covers and generalized snarks (extended abstract)
- Computational complexity of covering regular trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168434)
