𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sum List Coloring Block Graphs

✍ Scribed by Garth Isaak

Publisher
Springer Japan
Year
2004
Tongue
English
Weight
293 KB
Volume
20
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sum List Coloring Graphs
Sum List Coloring Graphs
✍ Adam Berliner; Ulrike Bostelmann; Richard A. Brualdi; Louis Deaett πŸ“‚ Article πŸ“… 2006 πŸ› Springer Japan 🌐 English βš– 137 KB
On list-coloring outerplanar graphs
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

Adapted list coloring of planar graphs
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 |_

Acyclic list 7-coloring of planar graphs
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

## Abstract The acyclic list chromatic number of every planar graph is proved to be at most 7. Β© 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002