𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planar graphs decomposable into a forest and a matching

✍ Scribed by Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka; Naeem N. Sheikh

Book ID
108113993
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
202 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decomposing a graph into forests
Decomposing a graph into forests
✍ Mickael Montassier; Patrice Ossona de Mendez; AndrΓ© Raspaud; Xuding Zhu πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 232 KB
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.

Decomposing a Planar Graph into an Indep
Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 126 KB

We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph.

Covering a Graph by Forests and a Matchi
Covering a Graph by Forests and a Matching
✍ Kaiser, TomΓ‘Ε‘; Montassier, MickaΓ«l; Raspaud, AndrΓ© πŸ“‚ Article πŸ“… 2011 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 161 KB