定义了多重图的R(k,n:p)-边着色,并利用正交拉丁方和矩阵的乘法证明了当m≡0(mod2)时,图M_(2m)~((r))是R(2,m:4)-边着色图。
R(k,n:p)-edge-coloring for multigraph is defined first. Basing on orthogonal latin square and matrix multiplication, we prove that mn(r)multigraph is R(2,m: 4)-edge-coloring graph as m=0 (mod2).