摘要: Let G be a graph, k1,…, km be positive integers. If dG(x) ≤ k1+…+km-m+1 for all x∈V(G),and H is a m-path,or a m-cycle,then G has a[0,ki]1m-factorization orthogonol to H.
马润年, 白国强. ON ORTHOGONAL[0,k1]1m-FACTORIZATION OF GRAPHS[J]. 数学物理学报(英文版), 1998, 18(4): 461-465.
Ma Runnian, Bai Guoqiang. ON ORTHOGONAL[0,k1]1m-FACTORIZATION OF GRAPHS[J]. Acta mathematica scientia,Series B, 1998, 18(4): 461-465.