摘要： A graph G is (g,f)-covered if each edge of G belongs to a (g,f)-factor. In this paper a necessary and sufficient condition for a graph to be (g,f)-covered is given.
刘桂真. ON (g, f)-COVERED GRAPHS[J]. 数学物理学报(英文版), 1988, 8(2): 181-184.
Liu Guizhen. ON (g, f)-COVERED GRAPHS[J]. Acta mathematica scientia,Series B, 1988, 8(2): 181-184.