scientific article; zbMATH DE number 1107736
From MaRDI portal
Publication:4373685
Recommendations
Cited in
(26)- Covering regular graphs
- Computational complexity of covering disconnected multigraphs
- List covering of regular multigraphs
- On the computational complexity of partial covers of theta graphs
- Computational complexity of covering three-vertex multigraphs
- Complexity of locally injective homomorphism to the Theta graphs
- Locally injective homomorphism to the simple weight graphs
- scientific article; zbMATH DE number 91031 (Why is no real title available?)
- scientific article; zbMATH DE number 2081019 (Why is no real title available?)
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Dichotomy of the H-quasi-cover problem
- Algorithmic aspects of regular graph covers with applications to planar graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- Graph covers: where topology meets computer science, and simple means difficult
- List covering of regular multigraphs with semi-edges
- Complexity of graph covering problems
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- 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
- Computational complexity of covering regular trees
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- Mixed hypergraphs and other coloring problems
- Computational complexity of covering three-vertex multigraphs
- Comparing universal covers in polynomial time
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 Q4373685)
