摘要： A graph G is k-covered if each edge of G belongs to a k-factor of G. We determine some valuee of k for which every r-regular graph with edge-connectivity λ is k-covered.
刘桂真. REGULAR k-COVERED GRAPHS[J]. 数学物理学报(英文版), 1989, 9(2): 227-230.
Liu Guizhen. REGULAR k-COVERED GRAPHS[J]. Acta mathematica scientia,Series B, 1989, 9(2): 227-230.