Abstract
A Theta graph is a multigraph which is a union of at least three internally disjoint paths that have the same two distinct end vertices. In this extended abstract 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 Theta graph. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Lidický, B., & Tesař, M. (2011). Complexity of locally injective homomorphism to the theta graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6460 LNCS, pp. 326–336). https://doi.org/10.1007/978-3-642-19222-7_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
