𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adapted List Coloring of Graphs and Hypergraphs

✍ Scribed by Kostochka, A. V.; Zhu, Xuding

Book ID
118197010
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
186 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 |_

Coloring Face-Hypergraphs of Graphs on S
Coloring Face-Hypergraphs of Graphs on Surfaces
✍ AndrΓ© KΓΌndgen; Radhika Ramamurthi πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 223 KB

The face-hypergraph, H(G), of a graph G embedded in a surface has vertex set V(G), and every face of G corresponds to an edge of H(G) consisting of the vertices incident to the face. We study coloring parameters of these embedded hypergraphs. A hypergraph is k-colorable (k-choosable) if there is a c

Dimension, Graph and Hypergraph Coloring
Dimension, Graph and Hypergraph Coloring
✍ Stefan Felsner; William T. Trotter πŸ“‚ Article πŸ“… 2000 πŸ› Springer Netherlands 🌐 English βš– 91 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