𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic chromatic indices of planar graphs with girth at

✍ Scribed by Qiaojun Shu; Weifan Wang

Book ID
106407398
Publisher
Springer US
Year
2010
Tongue
English
Weight
654 KB
Volume
23
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Girth and fractional chromatic number of
Girth and fractional chromatic number of planar graphs
✍ Amir Pirnazar; Daniel H. Ullman πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 152 KB πŸ‘ 1 views

## Abstract In 1959, even before the Four‐Color Theorem was proved, GrΓΆtzsch showed that planar graphs with girth at least 4 have chromatic number at the most 3. We examine the fractional analogue of this theorem and its generalizations. For any fixed girth, we ask for the largest possible fraction

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