✦ LIBER ✦

On the list dynamic coloring of graphs

✍ Scribed by S. Akbari; M. Ghanbari; S. Jahanbekam

Book ID: 108112826
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 317 KB
Volume: 157
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.05.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Acyclic List Edge Coloring of Graphs

✍ Hsin-Hao Lai; Ko-Wei Lih 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 595 KB

Adapted list coloring of planar graphs

✍ Louis Esperet; Mickaël Montassier; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 1 views

## Abstract Given an edge coloring __F__ of a graph __G__, a vertex coloring of __G__ is __adapted to F__ if no color appears at the same time on an edge and on its two endpoints. If for some integer __k__, a graph __G__ is such that given any list assignment __L__ to the vertices of __G__, with |_

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

List coloring of Cartesian products of g

List coloring of Cartesian products of graphs

✍ Mieczysław Borowiecki; Stanislav Jendrol’; Daniel Král’; Jozef Miškuf 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Acyclic list 7-coloring of planar graphs

✍ O. V. Borodin; D. G. Fon-Der Flaass; A. V. Kostochka; A. Raspaud; E. Sopena 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views