Some remarks about factors of graphs

被引：20

作者：

Correa, Jose R. ^{[1
]}

Matamala, Martin ^{[2
,3
]}

机构：

[1] Univ Adolfo Ibanez, Sch Business, Santiago, Chile

[2] Univ Chile, CNRS, UMR 2071, Dept Ingn Matemat, Santiago, Chile

[3] Univ Chile, CNRS, UMR 2071, Ctr Modelamiento Matemat, Santiago, Chile

来源：

JOURNAL OF GRAPH THEORY | 2008年 / 57卷 / 04期

关键词：

graph theory; factors;

D O I：

10.1002/jgt.20284

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)(V) <= f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f)-factor. We extend, to the case of edge-weighted graphs, a result of Kano and Saito who showed that if g(v) < lambda deg(E)(V) < f(v) for any lambda is an element of [0, 1], then a (g, f)-factor always exist. In addition, we use results of Anstee to provide new necessary and sufficient conditions for the existence of a (g, f)-factor. (c) 2008 Wiley Periodicals, Inc.

引用

页码：265 / 274

页数：10

共 19 条

[1] SIMPLIFIED EXISTENCE THEOREMS FOR (G,F)-FACTORS [J].