Complexity of locally injective homomorphism to the Theta graphs
From MaRDI portal
Publication:3000520
Recommendations
Cites work
- scientific article; zbMATH DE number 91031 (Why is no real title available?)
- scientific article; zbMATH DE number 1236360 (Why is no real title available?)
- scientific article; zbMATH DE number 1107736 (Why is no real title available?)
- scientific article; zbMATH DE number 2038757 (Why is no real title available?)
- scientific article; zbMATH DE number 2080268 (Why is no real title available?)
- scientific article; zbMATH DE number 2081019 (Why is no real title available?)
- Covering regular graphs
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
- NP completeness of the edge precoloring extension problem on bipartite graphs
- On the complexity of H-coloring
- On the computational complexity of partial covers of theta graphs
- Partial covers of graphs
Cited in
(7)- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
- Locally injective homomorphism to the simple weight graphs
- An algorithmic framework for locally constrained homomorphisms
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- The complexity of locally injective homomorphisms
- An algorithmic framework for locally constrained homomorphisms
- List covering of regular multigraphs with semi-edges
This page was built for publication: Complexity of locally injective homomorphism to the Theta graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000520)