✦ LIBER ✦

Decomposing Graphs into Long Paths

✍ Scribed by Alexandr Kostochka; Vladimir Tashkinov

Book ID: 111603066
Publisher: Springer Netherlands
Year: 2003
Tongue: English
Weight: 205 KB
Volume: 20
Category: Article
ISSN: 0167-8094
DOI: 10.1023/b:orde.0000026488.11602.7b

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.

Decomposing a graph into forests

✍ Mickael Montassier; Patrice Ossona de Mendez; André Raspaud; Xuding Zhu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Decomposing toroidal graphs into circuit

Decomposing toroidal graphs into circuits and edges

✍ Baogang Xu; Lusheng Wang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 215 KB

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 complete equipartite graphs

Decomposing complete equipartite graphs into short even cycles

✍ Benjamin R. Smith; Nicholas J. Cavenagh 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.

Long paths in sparse random graphs

✍ Béla Bollobás 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 207 KB