图的（g，f）－因子和因子分解

(g,f)-Factors and Factorizations of Graphs

设Ｇ是一个图，ｇ，ｆ是定义在图Ｇ的顶点集上的两个整数值函数且图Ｇ的一个（ｇ，ｆ）－因子是Ｇ的一个支撑子图Ｆ使对任意的ｘ∈Ｖ（Ｆ）有本文给出了一个图（ｇ，ｆ）－可因子化的若干充分条件和一个图是（ｇ，ｆ）－消去图的充分必要条件，并研究了这些条件的应用。

Let G be a graph and g,j be two integer-valued hinctions defined on the vertexset of G and (g,f)-factor of a graph G is a spanning subgraph F of G such thatfor each vertex x of F Inthis paper some sumcient conditions for a graphto be (g,f)-factorable and a necessary and sufficient condition for a grah to be a (g,f)-deleted guaph are given Some applications of these conditions are discussed .