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. © 2011 Springer-Verlag.
CITATION STYLE
Bílka, O., Lidický, B., & Tesař, M. (2011). Locally injective homomorphism to the simple weight graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6648 LNCS, pp. 471–482). https://doi.org/10.1007/978-3-642-20877-5_46
Mendeley helps you to discover research relevant for your work.