✦ LIBER ✦

Decomposing a graph into forests

✍ Scribed by Mickael Montassier; Patrice Ossona de Mendez; André Raspaud; Xuding Zhu

Book ID: 113698885
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 232 KB
Volume: 102
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.04.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar graphs decomposable into a forest

Planar graphs decomposable into a forest and a matching

✍ Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka; Naeem N. Sheikh 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 202 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 star graph into disjoint c

Decomposing a star graph into disjoint cycles

✍ K. Qiu; H. Meijer; S. Akl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 580 KB

On decomposing a graph into nontrivial b

On decomposing a graph into nontrivial bonds

✍ Sean McGuinness 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

We show that for every 2-connected bipartite graph which is not a multiple edge and which has no K 5 -minor there is an edge-disjoint collection of nontrivial bonds (i.e., not stars) which partition the edges of the graph.

Decomposing the complete graph into dode

Decomposing the complete graph into dodecahedra

✍ P. Adams; D.E. Bryant; A.D. Forbes; T.S. Griggs 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Decomposing Graphs into Long Paths

✍ Alexandr Kostochka; Vladimir Tashkinov 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 205 KB