d-cube decompositions of K-n/K-m

被引：2
作者：
Adams, P
Bryant, DE
ElZanati, SI
VandenEynden, C
机构：
[1] ILLINOIS STATE UNIV,DEPT MATH,NORMAL,IL 61790
[2] UNIV QUEENSLAND,DEPT MATH,BRISBANE,QLD 4072,AUSTRALIA
来源：
GRAPHS AND COMBINATORICS | 1997年 / 13卷 / 01期
关键词：
D O I：
10.1007/BF01202232
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m.
引用
收藏
页码：1 / 7
页数：7
相关论文
共 14 条
[1]  
[Anonymous], 1990, DECOMPOSITIONS GRAPH
[2]  
BONDY JA, 1976, GRAPH THEORY APPLICA
[3]  
Bryant D. E., 1994, AUSTRALAS J COMBIN, V9, P284
[4]  
BRYANT DE, IN PRESS DISCRETE MA
[5]  
ElZanati S, 1996, J COMB DES, V4, P51, DOI 10.1002/(SICI)1520-6610(1996)4:1<51::AID-JCD5>3.0.CO
[6]  
2-Z
[7]  
ELZANATI S, IN PRESS ARS COMB
[8]   MAXIMUM PACKINGS WITH ODD CYCLES [J].
ELZANATI, SI .
DISCRETE MATHEMATICS, 1994, 131 (1-3) :91-97
[9]  
HARTMAN A, 1993, GRAPHS MATRICES DESI, P171
[10]   ON THE CONSTRUCTION OF ODD CYCLE SYSTEMS [J].
HOFFMAN, DG ;
LINDNER, CC ;
RODGER, CA .
JOURNAL OF GRAPH THEORY, 1989, 13 (04) :417-426
12