𝔖 Bobbio Scriptorium
✦   LIBER   ✦

k L-list λ colouring of graphs

✍ Scribed by Dorotea De Luca Cardillo; Nicola Mione


Book ID
108445476
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
356 KB
Volume
106
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


List-colourings of graphs
✍ B. Bollobás; A. J. Harris 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 597 KB
List colourings of planar graphs
✍ Margit Voigt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 259 KB

A graph G = G( V, E) is called L-list colourable if there is a vertex colouring of G in which the colour assigned to a vertex u is chosen from a list L(v) associated with this vertex. We say G is k-choosable if all lists L(u) have the cardinality k and G is L-list colourable for all possible assignm