On Fractional (g, f)-Covered Graphs
Z Iangsun · Or Transactions · 2002
A graph G is fractional (g,f)-covered if each edge e of G belongs to a fractional (g,f)-factor, such that h(e) = 1, where h is the indicator function of fractional (g,f)-factor. In this paper, a necessary and sufficient condition for a graph to be fractional (g, f)- covered is given.