𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 3-choosable planar graphs of girth at least 4

✍ Scribed by Xiangwen Li

Book ID
108114052
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
761 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On 3-colorable non-4-choosable planar gr
On 3-colorable non-4-choosable planar graphs
✍ Voigt, M.; Wirth, B. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 72 KB πŸ‘ 2 views

An L-list coloring of a graph G is a proper vertex coloring in which every vertex v gets a color from a list L(v) of allowed colors. G is called k-choosable if all lists L(v) have exactly k elements and if G is L-list colorable for all possible assignments of such lists. Verifying conjectures of Erd

Group chromatic number of planar graphs
Group chromatic number of planar graphs of girth at least 4
✍ Hong-Jian Lai; Xiangwen Li πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 212 KB πŸ‘ 1 views

## Abstract Jeager et al. introduced a concept of group connectivity as a generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5‐edge connected graph is Z~3~‐connected. For planar graphs, this is equivalent to that every planar graph with girth at lea