位置：成果数据库 > 期刊 > 期刊详情页
Large sets of K-2,K-2-decomposition of complete bipartite graphs
  • ISSN号：0381-7032
  • 期刊名称：Ars Combinatoria
  • 时间：0
  • 页码：353-360
  • 相关项目：Hamilton圈分解和路分解的大集
作者： Hao, Guohui|
同期刊论文项目
Hamilton圈分解和路分解的大集
期刊论文 15
同项目期刊论文
Completing the Spectrum of Resolvable (K-4 - e)-Designs
Large sets of P-3-decompositions of complete multipartite graphs
Incomplete group divisible designs with block size four and general index
基于对控制数与双控制数强相等的图
关于图的负k-子确定数的上界
Bounds on the locating-total domination number of a tree
Another product construction for large sets of resolvable directed triple systems
Large sets of oriented P_3-decompositions of directed complete bipartite graphs
Super-Simple Resolvable Balanced Incomplete Block Designs with Block Size 4 and Index 4
Large sets of lambda-fold K-1,K-3-factors of complete bipartite graphs
Large Sets of Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs
Strong equality of domination parameters in graphs
夫妻围梯形桌入座问题