𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acyclic 3-choosability of planar graphs without cycles of length from 4 to 12

✍ Scribed by O. V. Borodin

Book ID
111471273
Publisher
Pleiades Publishing
Year
2010
Tongue
English
Weight
415 KB
Volume
4
Category
Article
ISSN
1990-4789

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Acyclic 5-choosability of planar graphs
Acyclic 5-choosability of planar graphs without small cycles
✍ MickaΓ«l Montassier; AndrΓ© Raspaud; Weifan Wang πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 1 views

## Abstract A proper vertex coloring of a graph __G__ = (__V,E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is acyclically __L__‐list colorable if for a given list assignment __L__ = {__L__(__v__): __v__:β€‰βˆˆβ€‰__V__}, there exists a proper acyclic coloring ϕ of __G__ such that Ο•(_

Acyclic 5-choosability of planar graphs
Acyclic 5-choosability of planar graphs without adjacent short cycles
✍ O. V. Borodin; A. O. Ivanova πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 93 KB πŸ‘ 1 views

The conjecture on acyclic 5-choosability of planar graphs [Borodin et al., 2002] as yet has been verified only for several restricted classes of graphs. None of these classes allows 4-cycles. We prove that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cy