位置：成果数据库 > 期刊 > 期刊详情页
The proof of Ushio's con- jecture concerning path factorization of complete bipartite graphs
  • 时间：0
  • 相关项目：α-可分解设计和仿射可分解设计
同期刊论文项目
α-可分解设计和仿射可分解设计
期刊论文 23 会议论文 1
同项目期刊论文
On K1,k-factorization of bi- partite multigraphs
P4k-1-factorization of bi- partite multigraphs
Pk-factorization of symmetric complete bipartite digraphs
Splitting balanced incom- plete block designs with block size 2(4
P5-factorization of complete bipartite graphs
Embeddings ofα-resolvable Steiner triple systems
N(2N瓶颈指派问题及其阀门（threshold）算法
α-resolvable group divi- sible designs with block size four and group size three
Existence of resolvable optimal strong partially balanced designs
Resolvable optimal strong partially balanced designs with block size four
完全二部图存在路因子分解的Ushio猜想的证明
二部多重图的P4k-1-因子分解
The number of triangles in 2-factorizations
Three-fold Kirkman packing designs KPD3({4,s*},v)
二部多重图路因子分解的存在谱
The spectrum of path factori- zation of bipartite multi- graphs
α-resolvable group divi- sible designs with block size four and groups size six and nine
The existence of resolvable Mendelsohn designs RMD({4, s*},v)
Existence of optimal strong partially balanced designs
可分解分裂BIBD的构作
On K1,k-factorization of bipartite multigraphs
λKm,n的Pk-分解