✦ 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
DOI: 10.1016/s0377-2217(98)00299-9

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

(v, k, λ)-Graphs and polarities of (v, k

(v, k, λ)-Graphs and polarities of (v, k, λ)-designs

✍ Arunas Rudvalis 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 French ⚖ 403 KB

Application of polynomial method to on-l

Application of polynomial method to on-line list colouring of graphs

✍ Po-Yi Huang; Tsai-Lien Wong; Xuding Zhu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Grid drawings of k-colourable graphs

✍ David R. Wood 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 170 KB

List-colouring the square of a -minor-fr

List-colouring the square of a -minor-free graph

✍ Timothy J. Hetherington; Douglas R. Woodall 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 195 KB