✦ LIBER ✦

On the complexity of -colouring planar graphs

✍ Scribed by G. MacGillivray; M. Siggers

Book ID: 108114040
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 924 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.05.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of colouring problems on

The complexity of colouring problems on dense graphs

✍ Keith Edwards 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 370 KB

The complexity of H-colouring of bounded

The complexity of H-colouring of bounded degree graphs

✍ Anna Galluccio; Pavol Hell; Jaroslav Nešetřil 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 104 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

Note on the colouring of graphs

✍ G. A. Dirac 📂 Article 📅 1951 🏛 Springer-Verlag 🌐 French ⚖ 400 KB

The complexity of the chromatic sum prob

The complexity of the chromatic sum problem on cubic planar graphs and regular graphs

✍ Michal Malafiejski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 12 KB

On the complexity of finding even pairs

On the complexity of finding even pairs in planar perfect graphs

✍ Rudini M. Sampaio; Cléudia L. Sales 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 271 KB