MAXIMUM (G, F)-FACTORS OF A GENERAL GRAPH

被引：3

作者：

CHEN, WYC

机构：

[1] Department of Mathematics, Massachusetts Institute of Technology, Cambridge

来源：

DISCRETE MATHEMATICS | 1991年 / 91卷 / 01期

关键词：

D O I：

10.1016/0012-365X(91)90158-X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This paper presents a characterization of maximum (g, f)-factors of a general graph in which multiple edges and loops are allowed. An analogous characterization of the minimum (g, f)-factors of a general graph is also presented. In addition, we obtain a transformation theorem for any two general graphs on the same vertex set. As special cases, we have the transformation theorems for both maximum (g, f)-factors and minimum (g, f)-factors. Our results generalize some of C. Berge's results on maximum matchings and maximum c-matchings of a multiple graph.

引用

页码：1 / 7

页数：7

共 8 条

[1] FACTORS AND FACTORIZATIONS OF GRAPHS - A SURVEY [J].