𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Planar Graphs Arbitrarily Decomposable into Closed Trails

✍ Scribed by Mirko Horňák; Zuzana Kocková

Book ID
106047710
Publisher
Springer Japan
Year
2008
Tongue
English
Weight
230 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposing a Planar Graph into Degenera
Decomposing a Planar Graph into Degenerate Graphs
✍ C. Thomassen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

We prove the conjecture made by \(\mathrm{O}\). V. Borodin in 1976 that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph. that is, a forest. c. 1995 Academic Press. Inc.