𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Choosability of K5-minor-free graphs

✍ Scribed by Riste Sˇkrekovski

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
153 KB
Volume
190
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Thomassen, 1994

showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all Ks-minor-free graphs are 5-choosable. (~) 1998 Elsevier Science B.V.

📜 SIMILAR VOLUMES

List Colorings of K5-Minor-Free Graphs W
List Colorings of K5-Minor-Free Graphs With Special List Assignments
✍ Daniel W. Cranston; Anja Pruchnewski; Zsolt Tuza; Margit Voigt 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

The following question was raised by Bruce Richter. Let G be a planar, 3-connected graph that is not a complete graph. Denoting by d(v) the degree of vertex v, is G L-list colorable for every list assignment L with |L(v)|=min{d(v), 6} for all v ∈ V (G)? More generally, we ask for which pairs (r, k)

Circular consecutive choosability of k-c
Circular consecutive choosability of k-choosable graphs
✍ Daphne Liu,; Serguei Norine,; Zhishi Pan;; Xuding Zhu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

Let S(r ) denote a circle of circumference r. The circular consecutive choosability ch cc (G) of a graph G is the least real number t such that

Precoloring extension for K4-minor-free
Precoloring extension for K4-minor-free graphs
✍ Anja Pruchnewski; Margit Voigt 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB 👁 1 views

## Abstract Let __G__=(__V, E__) be a graph where every vertex __v__∈__V__ is assigned a list of available colors __L__(__v__). We say that __G__ is list colorable for a given list assignment if we can color every vertex using its list such that adjacent vertices get different colors. If __L__(__v_

Choosability, Edge Choosability, and Tot
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs
✍ Wang Weifan; Ko-Wei Lih 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Let χ l (G), χ l (G), χ l (G), and (G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. ( 1 and only if G is an odd cycle. This proves the

Defective choosability of graphs with no
Defective choosability of graphs with no edge-plus-independent-set minor
✍ Douglas R. Woodall 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB

## Abstract It is proved that, if __s__ ≥ 2, a graph that does not have __K__~2~ + __K__~__s__~ = __K__~1~ + __K__~1, __s__~ as a minor is (__s__, 1)\*‐choosable. This completes the proof that such a graph is (__s__ + 1 − __d__,__d__)\*‐choosable whenever 0 ≤ __d__ ≤ __s__ −1 © 2003 Wiley Periodica