✦ LIBER ✦

List-colourings of graphs

✍ Scribed by B. Bollobás; A. J. Harris

Book ID: 110567471
Publisher: Springer Japan
Year: 1985
Tongue: English
Weight: 597 KB
Volume: 1
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02582936

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Ordered colourings of graphs

✍ E.J Cockayne; A.G Thomason 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Set colourings of graphs

✍ Béla Bollobás; Andrew Thomason 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 584 KB

Distance-regular graphs, MH-colourings a

Distance-regular graphs, MH-colourings and MLD-colourings

✍ T.S. Griggs; B.J. Wilson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Continuous colourings of closed graphs

✍ Adam Krawczyk; J. Steprāns 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 898 KB

k L-list λ colouring of graphs

✍ Dorotea De Luca Cardillo; Nicola Mione 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 356 KB