Locally Injective Homomorphism to the Simple Weight Graphs
A Weight graph is a connected (multi)graph with two vertices u and v of degree at least three and other vertices of degree two. Moreover, if any of these two vertices is removed, the remaining graph contains a cycle. A Weight graph is called simple if the degree of u and v is three. We show full computational complexity characterization of the problem of deciding the existence of a locally injective homomorphism from an input graph G to any fixed simple Weight graph by identifying some polynomial cases and some NP-complete cases.
Keywordscomputational complexity locally injective homomorphism Weight graph
Unable to display preview. Download preview PDF.
- 3.Feder, T., Vardi, M.Y.: Monotone monadic SNP and constraint satisfaction. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 612–622 (1993)Google Scholar
- 5.Fiala, J.: Locally injective homomorphisms, disertation thesis (2000)Google Scholar
- 17.Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216–226 (1978)Google Scholar