Graph decomposition of graphs with seven vertices and seven edges
YUAN Landang1,YANG Libao2,GU Liyan1,BAI Zhanli3
1.Hebei Mathematics Research Center, School of Mathematical Sciences, Hebei Normal University, Shijiazhuang 050024, China; 2.School of Mathematics and Information Technology, Xingtai University, Xingtai 054001, China; 3.Editorial Department of Journal, Hebei Normal University, Shijiazhuang 050024, China
[1] ALSPACHB, GAVLASH. Cycle decompositions of K_n and K{n}-I[J].J Combin Theory Ser B, 2001, 81(1):77-99.DOI:10.1006/jctb.2000.1996. [2] BOSAK J. Decompositions of graphs[M]. Boston: Kluwer Academic Publishers, 1990. [3] 刘淑霞.一个二部图的图分解[J].河北师范大学学报(自然科学版),2004,28(6):552-555. [4] SAJNA M. Cycle decompositions Ⅲ: Complete graphs and fixed length cycles[J]. J Combin Des,2002, 10(1): 27-78.DOI:10.1002/jcd.1027. [5] YUAN L D, KANG Q D.Graph designs for eight graphs with six vertices and eight edges(index >1)[J].Ars Combin, 2008, 87: 403-413. [6] YUAN L D, KANG Q D. Decomposition of λK_v into five graphs with six vertices and eight edges[J].Acta Math Appl Sin Engl Ser, 2012,28(4): 823-832.DOI:10.1007/S10255-012-0191-1. [7] COLBOURN C, DINITZ J. Handbook of combinatorial designs[M]. Boca Raton:CRC Press, 2006. (
