In this paper we prove that there are either 2k&2 or 2k&1 pairwise compatible Hamilton path decompositions of K 2k . In the case of K 4 , there exactly 2 compatible Hamilton path decompositions. We also find (different) lower bounds on the number of pairwise compatible Hamilton decompositions of K 4
โฆ LIBER โฆ
d-Cube decompositions ofKn/Km
โ Scribed by Peter Adams; Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden
- Book ID
- 105115954
- Publisher
- Springer Japan
- Year
- 1997
- Tongue
- English
- Weight
- 288 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Pairwise Compatible Hamilton Decompositi
โ
H Verrall
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 363 KB
Decompositions of Km,n into cubes
โ
Saad El-Zanati; Charles Vanden Eynden
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 384 KB
For a complete bipartite graph to be decomposable into isomorphic cubes, certain conditions on the number of cube and bipartition vertices must hold. We prove these necessary conditions sufficient in some cases. For cubes of fixed dimension d (indeed for d-regular bipartite graphs in general) we sho
Edge-colored cube decompositions
โ
Peter Adams; Darryn E. Bryant; Heather Jordon
๐
Article
๐
2006
๐
Springer
๐
English
โ 184 KB
Paradoxical Decompositions of the Cube a
โ
Wright, J. D. M.
๐
Article
๐
1990
๐
Oxford University Press
๐
English
โ 162 KB
Star Decompositions of Cubes
โ
Darryn E. Bryant; Saad El-Zanati; Charles Vanden Eynden; Dean G. Hoffman
๐
Article
๐
2001
๐
Springer Japan
๐
English
โ 83 KB
Decompositions Into Four Cubes
โ
Ko, C.
๐
Article
๐
1936
๐
Oxford University Press
๐
English
โ 52 KB