✦ LIBER ✦

Acyclic 4-colorability of planar graphs without cycles of length 4 or 6

✍ Scribed by O. V. Borodin

Book ID: 111471309
Publisher: Pleiades Publishing
Year: 2010
Tongue: English
Weight: 423 KB
Volume: 4
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478910040034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

-colorability of planar graphs without c

-colorability of planar graphs without cycles of length 4, 5 or 9

✍ Wang, Yingqian; Yang, Yaochou 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs without 4-cycles

✍ Weifan Wang, Qiaojun Shu, Yiqiao Wang 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 811 KB

-coloring of planar graphs without cycle

-coloring of planar graphs without cycles of length 4 and 6

✍ Bu, Yuehua; Fu, Caixia 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Acyclic 4-coloring of planar graphs with

Acyclic 4-coloring of planar graphs without 4- and 5-cycles

✍ O. V. Borodin 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 500 KB

Planar graphs without cycles of length 4

Planar graphs without cycles of length 4 or 5 are -colorable

✍ Hill, Owen; Smith, Diana; Wang, Yingqian; Xu, Lingji; Yu, Gexin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 393 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__)∈_