𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of tree homomorphisms

✍ Scribed by P. Hell; J. Nešetřil; X. Zhu

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
704 KB
Volume
70
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of homomorphisms to direct pr
Complexity of homomorphisms to direct products of graphs
✍ Judit Büki; Csaba Szabó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 55 KB

For a graph G, OAL G asks whether or not an input graph H together with a partial map g : G 2 are trees and NP-complete otherwise.

Bi-arc graphs and the complexity of list
Bi-arc graphs and the complexity of list homomorphisms
✍ Tomas Feder; Pavol Hell; Jing Huang 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract Given graphs __G__, __H__, and lists __L__(__v__) ⊆ __V__(__H__), __v__ ε __V__(__G__), a list homomorphism of __G__ to __H__ with respect to the lists __L__ is a mapping __f__ : __V__(__G__) → __V__(__H__) such that __u__v ε __E__(__G__) implies __f__(__u__)__f__(__v__) ε __E__(__H__),