On \((g,f)\)-uniform graphs (Q2577646): Difference between revisions

A \((g,f)\)-factor of a graph \(G\) is a spanning subgraph \(F\) of \(G\) with \(g(x)\leq d_F(x)\leq f(x)\) for all \(x\in V(G)\). \(G\) is \((g,f)\)-uniform if for each edge of \(G\), there is a \((g,f)\)-factor containing it and another \((g,f)\)-factor excluding it. In this paper a necessary and sufficient condition for a graph to be a \((g,f)\)-uniform graph is given and some applications of this condition are discussed.