
doi: 10.1007/bf01202232
Necessary conditions onn, m andd are given for the existence of an edge-disjoint decomposition ofK n/K m into copies of the graph of ad-dimensional cube. Sufficiency is shown whend=3 and, in some cases, whend=2t. We settle the problem of embedding 3-cube decompositions ofK m into 3-cube decompositions ofK n, wheren?m.
2607 Discrete Mathematics and Combinatorics, 2614 Theoretical Computer Science, Graphs, Mathematics
2607 Discrete Mathematics and Combinatorics, 2614 Theoretical Computer Science, Graphs, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
