𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposing the complete graph into dodecahedra

✍ Scribed by P. Adams; D.E. Bryant; A.D. Forbes; T.S. Griggs

Book ID
113757586
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
187 KB
Volume
142
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

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 complete equipartite graphs
Decomposing complete equipartite graphs into cycles of length 2p
✍ Benjamin R. Smith πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 161 KB πŸ‘ 1 views

## Abstract It is an open problem to determine whether a complete equipartite graph $K\_m\*{\overline{K}}\_n$ (having __m__ parts of size __n__) admits a decomposition into cycles of arbitrary fixed length $k$ whenever __m__, __n__, and __k__ satisfy the obvious necessary conditions for the existen

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.