✦ LIBER ✦

The 2-surviving rate of planar graphs without 4-cycles

✍ Scribed by Wang, Weifan; Kong, Jiangxu; Zhang, Lianzhu

Book ID: 119375365
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 289 KB
Volume: 457
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.07.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The surviving rate of planar graphs

✍ Jiangxu Kong; Weifan Wang; Xuding Zhu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Acyclic 5-choosability of planar graphs

Acyclic 5-choosability of planar graphs without 4-cycles

✍ O. V. Borodin; A. O. Ivanova 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 327 KB

Planar graphs without 4-cycles adjacent

Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable

✍ Oleg V. Borodin; Anna O. Ivanova 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

## Abstract It is known that not all planar graphs are 4‐choosable; neither all of them are vertex 2‐arborable. However, planar graphs without 4‐cycles and even those without 4‐cycles adjacent to 3‐cycles are known to be 4‐choosable. We extend this last result in terms of covering the vertices of a

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

On total chromatic number of planar grap

On total chromatic number of planar graphs without 4-cycles

✍ Ying-qian Wang; Min-le Shangguan; Qiao Li 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 166 KB

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