✦ LIBER ✦

-forested choosability of planar graphs and sparse graphs

✍ Scribed by Xin Zhang; Guizhen Liu; Jian-Liang Wu

Book ID: 113567501
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 240 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.10.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Choosability of planar graphs

✍ Margit Voigt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A graph G = G(EE) with lists L(v), associated with its vertices v E V, is called L-list colourable if there is a proper vertex colouring of G in which the colour assigned to a vertex v is chosen from L(v). We say G is k-choosable if there is at least one L-list colouring for every possible list assi

Adaptable choosability of planar graphs

Adaptable choosability of planar graphs with sparse short cycles

✍ Albert Guan; Xuding Zhu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 370 KB

Choosability and edge choosability of pl

Choosability and edge choosability of planar graphs without five cycles

✍ Weifan Wang; Ko-Wei Lih 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 402 KB

## It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)-h

Choosability and Edge Choosability of Pl

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

✍ Wang, Wei-Fan; Lih, Ko-Wei 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 140 KB

The complexity of planar graph choosabil

The complexity of planar graph choosability

✍ Shai Gutner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Every Planar Graph Is 5-Choosable

✍ C. Thomassen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 56 KB

We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdös, A. L. Rubin, and H. Taylor. (i) 1994 Academic Press, Inc.