Sufficient conditions for graphs to have (g,f)-factors

被引：21

作者：

Egawa, Y

Kano, M

机构：

[1] SCI UNIV TOKYO,DEPT APPL MATH,SHINJUKU KU,TOKYO 162,JAPAN

[2] AKASHI TECHNOL COLL,DEPT MATH,AKASHI,HYOGO 674,JAPAN

来源：

DISCRETE MATHEMATICS | 1996年 / 151卷 / 1-3期

关键词：

All Open Access; Bronze;

D O I：

10.1016/0012-365X(94)00085-W

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give sufficient conditions for a graph to have a (g,f)-factor. For example, we prove that a graph G has a (g,f)-factor if g(v) < f(v) for all vertices v of G and g(x)/deg(G)(x) less than or equal to f(y)/deg(G)(y)for all adjacent vertices x and y of G.

引用

页码：87 / 90

页数：4