Acta mathematica scientia,Series B ›› 1988, Vol. 8 ›› Issue (2): 181-184.

• Articles • Previous Articles     Next Articles

ON (g, f)-COVERED GRAPHS

Liu Guizhen   

  1. Dept. of Math., Shandong University, Jinan
  • Received:1986-10-28 Online:1988-06-25 Published:1988-06-25

Abstract: 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.

Trendmd