✦ LIBER ✦

Acyclic 6-choosability of planar graphs without adjacent short cycles

✍ Scribed by WeiFan Wang, Ge Zhang, Min Chen

Book ID: 120796527
Publisher: SP Science China Press
Year: 2013
Tongue: English
Weight: 318 KB
Volume: 57
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-013-4572-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Acyclic 4-choosability of planar graphs

Acyclic 4-choosability of planar graphs without adjacent short cycles

✍ Oleg V. Borodin; Anna O. Ivanova 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 441 KB

Group edge choosability of planar graphs

Group edge choosability of planar graphs without adjacent short cycles

✍ Zhang, Xin; Liu, Gui Zhen 📂 Article 📅 2013 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 192 KB

(3, 1)*-choosability of planar graphs wi

(3, 1)*-choosability of planar graphs without adjacent short cycles

✍ Chen, Min; Raspaud, André 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 174 KB

On (3,1)∗-choosability of planar graphs

On (3,1)∗-choosability of planar graphs without adjacent short cycles

✍ Chen, Min; Raspaud, André 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Planar graphs without 4-cycles are acycl

Planar graphs without 4-cycles are acyclically 6-choosable

✍ Weifan Wang; Min Chen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## 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 π(__v__)∈_