✦ LIBER ✦

Planar Graphs Have Exponentially Many 3-Arboricities

✍ Scribed by Harutyunyan, Ararat; Mohar, Bojan

Book ID: 118197180
Publisher: Society for Industrial and Applied Mathematics
Year: 2012
Tongue: English
Weight: 208 KB
Volume: 26
Category: Article
ISSN: 0895-4801
DOI: 10.1137/110846828

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fullerene graphs have exponentially many

Fullerene graphs have exponentially many perfect matchings

✍ František Kardoš; Daniel Král’; Jozef Miškuf; Jean-Sébastien Sereni 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 149 KB

Sub-Exponentially Many 3-Colorings of Tr

Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs

✍ Arash Asadi; Luke Postle; Robin Thomas 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The smallest non-hamiltonian 3-connected

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

✍ D.A Holton; B.D McKay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 604 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