𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path and cycle decompositions of complete equipartite graphs: Four parts

✍ Scribed by Billington, Elizabeth J. (author);Cavenagh, Nicholas J. (author);Smith, Benjamin R. (author)

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Closed trail decompositions of complete
Closed trail decompositions of complete equipartite graphs
✍ Andrea Burgess; Mateja Ε ajna πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 314 KB

## Abstract The complete equipartite graph \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$K\_m \* {\overline{K\_n}}$\end{document} has mn vertices partitioned into __m__ parts of size __n__, with two vertices adjacent if and only if they are in different parts. In this paper,

A note on path and cycle decompositions
A note on path and cycle decompositions of graphs
✍ Dom Decaen πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 1 views

## Abstract In the study of decompositions of graphs into paths and cycles, the following questions have arisen: Is it true that every graph __G__ has a smallest path (resp. path‐cycle) decomposition __P__ such that every odd vertex of __G__ is the endpoint of exactly one path of __P__? This note g