Complexity of locally injective homomorphism to the Theta graphs
DOI10.1007/978-3-642-19222-7_33zbMATH Open1326.68163OpenAlexW1609919256MaRDI QIDQ3000520FDOQ3000520
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_33
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- On the complexity of H-coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering regular graphs
- Title not available (Why is that?)
- Partial covers of graphs
- On the computational complexity of partial covers of theta graphs
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
- Title not available (Why is that?)
- NP completeness of the edge precoloring extension problem on bipartite graphs
Cited In (7)
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
- The complexity of locally injective homomorphisms
- An algorithmic framework for locally constrained homomorphisms
- 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
- 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)
