PALAYSI , Jérôme

Let G=(V(G), E(G)) be a graph. A list assignment is an assignment of a set L(v) of integers to every vertex v of G. An L-colouring is an application C from V(G) into the set of integers such that C(v)L(v) for all v V(G) and C(u)C(v) if u and v are joined by an edge. A (k,k')-list assignment of a bipartite graph G with bipartition (A,B) is a...