期刊文献+

P_3-FACTORIZATION OF COMPLETE MULTIPARTITE GRAPHS 被引量:3

P 3 FACTORIZATION OF COMPLETE MULTIPARTITE GRAPHS
下载PDF
导出
摘要 In this note it is shown that a necessary and sufficient condition for the existence of a P 3 factorization of complete multipartite graph λK n m is (1) m≥3, (2) mn≡0 (mod 3) and (3) λ(m-1)n≡0 (mod 4). In this note it is shown that a necessary and sufficient condition for the existence of a P 3 factorization of complete multipartite graph λK n m is (1) m≥3, (2) mn≡0 (mod 3) and (3) λ(m-1)n≡0 (mod 4).
作者 Du Beiliang
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 1999年第1期122-124,共3页 高校应用数学学报(英文版)(B辑)
关键词 1991 MR Subject Classification 05B30 05C70 1991 MR Subject Classification 05B30 05C70
  • 相关文献

同被引文献7

  • 1Ushio K.P3 - factorization of Complete Bipartite Graphs[].Discrete Mathematics.1988
  • 2Body J A, Murty U S R. Graph theory with applications [M ]. London and Basingstoke : Macmillan Press, 1976.
  • 3Ushio K. G-designs and related designs[J]. Discrete Math, 1993, 116(1/2/3):299-311.
  • 4Hoffman D G, Schellenberg P J. The existence of Ck -fac- torization of K2x/f [J]. Discrete Math, 1991, 976 (1/2/3) : 243-250.
  • 5Horton J D. Resolvable path designs[J]. J Combin Theory Ser A, 1985, 39(2) :117-131.
  • 6Ushio K. P3 -factorization of complete bipartite graphs [J]. Discrete Math, 1988, 72 (1/2/3) : 361-366.
  • 7Shi Jing, Wang Jian, Du Beiliang. On bipartite factorization of complete multigraphs [J]. Am Combinatoria, 2013, 18 (1) :481-491.

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部