摘要: A graph G is f-covered if each edge of G belongs to an f-factor. Some sufficient conditions for a graph to be f-covered are given.Katerinis' and Bermond's results are generalized.
刘桂真. SOME CONDITIONS FOR f-COVERED GRAPHS[J]. 数学物理学报(英文版), 1994, 14(S1): 91-97.
Liu Guizhen. SOME CONDITIONS FOR f-COVERED GRAPHS[J]. Acta mathematica scientia,Series B, 1994, 14(S1): 91-97.