关于消去图的一个充分条件

摘要

Let G be a graph with vertex set V（G） and edge setE（G）,and let g and f be two integer-valued functions defined on V（G） such that gf for every x∈V（G）,A（g,f）-factor of G is a spanning subgraph F of G such that g（x）≤dF（x） for every x∈V（G）.A graph G is called%设G是一个图,用V（G）和E（G）表示顶点集和边集,并设g和f是定义在V（G）上的两个非负整数值函数,且g