✦ LIBER ✦

Ordered colourings of graphs

✍ Scribed by E.J Cockayne; A.G Thomason

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 361 KB
Volume: 32
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90005-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Continuous colourings of closed graphs

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

Representing Groups by Colourings of Gra

Representing Groups by Colourings of Graphs

✍ Ulrike Baumann 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB

Neuwirth manifolds and colourings of gra

Neuwirth manifolds and colourings of graphs

✍ Alberto Cavicchioli 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 79 KB