✦ LIBER ✦

Adapted list coloring of planar graphs

✍ Scribed by Louis Esperet; Mickaël Montassier; Xuding Zhu

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 131 KB
Volume: 62
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20391

No coin nor oath required. For personal study only.

✦ Synopsis

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 |L(v)|⩾k for all v, and any edge coloring F of G, G admits a coloring c adapted to F where c(v)∈L(v) for all v, then G is said to be adaptably k‐choosable. In this note, we prove that K~5~‐minor‐free graphs are adaptably 4‐choosable, which implies that planar graphs are adaptably 4‐colorable and answers a question of Hell and Zhu. We also prove that triangle‐free planar graphs are adaptably 3‐choosable and give negative results on planar graphs without 4‐cycle, planar graphs without 5‐cycle, and planar graphs without triangles at distance t, for any t⩾0. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 127–138, 2009

📜 SIMILAR VOLUMES

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

Star coloring planar graphs from small l

Star coloring planar graphs from small lists

✍ André Kündgen; Craig Timmons 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

## Abstract A __star coloring__ of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every planar graph of girth 6 (respectively 7, 8) can be star colored from lists of size 8 (respectively 7, 6). We give an example of a planar graph

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

Star coloring bipartite planar graphs

✍ H. A. Kierstead; André Kündgen; Craig Timmons 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract A __star coloring__ of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eig

NP-completeness of list coloring and pre

NP-completeness of list coloring and precoloring extension on the edges of planar graphs

✍ Dániel Marx 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract In the edge precoloring extension problem, we are given a graph with some of the edges having preassigned colors and it has to be decided whether this coloring can be extended to a proper __k__‐edge‐coloring of the graph. In list edge coloring every edge has a list of admissible colors,

Oriented list colorings of graphs

✍ Zs. Tuza; M. Voigt 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 1 views

A 2-assignment on a graph G (V,E) is a collection of pairs Lv of allowed colors speci®ed for all vertices v PV. The graph G (with at least one edge) is said to have oriented choice number 2 if it admits an orientation which satis®es the following property: For every 2-assignment there exists a choic