✦ LIBER ✦

Edge choosability of planar graphs without short cycles

✍ Scribed by Weifan Wang

Book ID: 119987769
Publisher: SP Science China Press
Year: 2005
Tongue: English
Weight: 263 KB
Volume: 48
Category: Article
ISSN: 1674-7283
DOI: 10.1360/022004-49

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Choosability and edge choosability of pl

Choosability and edge choosability of planar graphs without five cycles

✍ Weifan Wang; Ko-Wei Lih 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 402 KB

## It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)-h

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