关于图（g，f）－因子的一个注记

NOTE ON(g,f)-FACTORS OF GRAPHS

设Ｇ是一个图，ｇ，ｆ是定义在图Ｇ的顶点集上的两个非负整数值函数，且ｇ≤ｆ．图Ｇ的一个（ｇ，ｆ）－因子是Ｇ的一个支撑子图Ｆ，使对任意的ｘ∈Ｖ（Ｆ）有ｇ（ｘ）≤ｄＦ（ｘ）≤ｆ（ｘ）．本文给出了一个图是（ｇ，ｆ）－可因子化的充分条件．

Let G be a graph and g,f be two integervalued functions defined on the vertex set of G and g≤f. A (g,f)-factor of graph G is a spanning subgraph F of G such that g(x) ≤dF(x)≤f(x) for each vertex x of F. In this paper, a sufficient condition for a graph to be(g, f) -factorizable is given.