✦ LIBER ✦

Group edge choosability of planar graphs without adjacent short cycles

✍ Scribed by Zhang, Xin; Liu, Gui Zhen

Book ID: 121617751
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2013
Tongue: English
Weight: 192 KB
Volume: 29
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-013-2531-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge choosability of planar graphs witho

Edge choosability of planar graphs without short cycles

✍ Weifan Wang 📂 Article 📅 2005 🏛 SP Science China Press 🌐 English ⚖ 263 KB

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

Acyclic 6-choosability of planar graphs

Acyclic 6-choosability of planar graphs without adjacent short cycles

✍ WeiFan Wang, Ge Zhang, Min Chen 📂 Article 📅 2013 🏛 SP Science China Press 🌐 English ⚖ 318 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