𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every planar graph has an acyclic 7-coloring

✍ Scribed by Michael O. Albertson; David M. Berman

Book ID
112885033
Publisher
The Hebrew University Magnes Press
Year
1977
Tongue
English
Weight
270 KB
Volume
28
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Acyclically 3-colorable planar graphs
Acyclically 3-colorable planar graphs
✍ Patrizio Angelini, Fabrizio Frati πŸ“‚ Article πŸ“… 2011 πŸ› Springer US 🌐 English βš– 524 KB
Acyclic colorings of planar graphs
Acyclic colorings of planar graphs
✍ Branko GrΓΌnbaum πŸ“‚ Article πŸ“… 1973 πŸ› The Hebrew University Magnes Press 🌐 English βš– 762 KB
Acyclic colorings of planar graphs
Acyclic colorings of planar graphs
✍ Wayne Goddard πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 223 KB
Acyclic edge coloring of planar graphs w
Acyclic edge coloring of planar graphs with colors
✍ DΓ‘vid HudΓ‘k; FrantiΕ‘ek KardoΕ‘; Borut LuΕΎar; Roman SotΓ‘k; Riste Ε krekovski πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 469 KB