When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

This is a book about graph homomorphisms. Graph theory is now an established discipline
but the study of graph homomorphisms has only recently begun to gain wide acceptance …

Many natural combinatorial problems can be expressed as constraint satisfaction problems.
This class of problems is known to be NP-complete in general, but certain restrictions on the …

Polymorphisms, and How to Use Them Page 1 Polymorphisms, and How to Use Them Libor Barto
∗1, Andrei Krokhin2, and Ross Willard †3 1 Department of Algebra, Faculty of Mathematics and …

Constraint satisfaction problems have enjoyed much attention since the early seventies, and
in the last decade have become also a focus of attention amongst theoreticians. Graph …

In a constraint satisfaction problem (CSP), the aim is to find an assignment of values to a
given set of variables, subject to specified constraints. The CSP is known to be NP-complete …

LetHbe a fixed graph. We introduce the following list homomorphism problem: Given an
input graphGand for each vertexvofGa “list” L (v)⊆ V (H), decide whether or not there is a …

In a constraint satisfaction problem (CSP), the aim is to find an assignment of values to a
given set of variables, subject to specified constraints. The CSP is known to be NP-complete …

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 map** f: V (G)→ V (H) such that uv ε E (G) implies f (u) f (v) ε E …

List partitions generalize list colorings and list homomorphisms.(We argue that they may be
called list" semihomomorphisms.") Each symmetric matrix M over 0, 1,* defines a list partition …