✦ LIBER ✦

A note on list-coloring powers of graphs

✍ Scribed by Kosar, Nicholas; Petrickova, Sarka; Reiniger, Benjamin; Yeager, Elyse

Book ID: 124117997
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 401 KB
Volume: 332
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.05.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on list improper coloring planar

A note on list improper coloring planar graphs

✍ Ko-Wei Lih; Zengmin Song; Weifan Wang; Kemin Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A graph G is called (k, d)\*-choosable if, for every list assignment L satisfying [L(v)l = k for all v E V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and /-c

Coloring Powers of Chordal Graphs

✍ Král', Daniel 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 170 KB

Coloring Powers of Planar Graphs

✍ Agnarsson, Geir; Halldórsson, Magnús M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 183 KB

On list-coloring outerplanar graphs

✍ Joan P. Hutchinson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

## Abstract We prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors __L__ (__v__ ) for each vertex __v__ such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be __L__‐list‐colored (except when

Sum List Coloring Graphs

✍ Adam Berliner; Ulrike Bostelmann; Richard A. Brualdi; Louis Deaett 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 137 KB

A Note on Semi-coloring of Graphs

✍ Baoyindureng Wu, Xingchao Deng, Xinhui An, Guiying Yan 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 155 KB