(g,f)- Factors in Bipartite (mg,mf)-Graphs
Guizhen Liu · Mathematica Applicata · 2003
Let G be bipartite a graph with vertex set V(G) and edge set E(G) let g and f be two positive ingeger-valued functions defined on V(G) such that g(x)≤f(x).A (g,f)-factor H of G is a spanning subgraph of G satisfying g(x)≤d H(x)≤f(x).A graph G is a (g,f)-graph means that G itself is a (g,f)-factor.In this paper sufficient conditions for a bipartite (mg,mf)-graph to have a (g,f)-factor with special properties are given.Therefore the result inis generalized.