k-factor-covered regular graphs

被引：0

作者：

Shen, J ^{[1
]}

Zhang, HP ^{[1
]}

机构：

[1] Lanzhou Univ, Dept Math, Lanzhou 730000, Peoples R China

来源：

ARS COMBINATORIA | 2005年 / 75卷

关键词：

regular graph; f-factor; k-factor; k-factor-covered graph; k-factor-deleted graph;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G is called f-factor-covered if every edge of G is contained in some f-factor. G is called f-factor-deleted if G - e contains a f-factor for every edge e. Babler proved that every r-regular, (r - 1)-edge-connected graph of even order has a 1-factor. In the present article, we prove that every 2r-regular graph of odd order is both 2m-factor-covered and 2m-factor-deleted for all integers m, 1 <= m <= r - 1, and every r-regular, (r - 1)-edge-connected graph of even order is both m-factor-covered and m-factor-deleted for all integers m, 1 <= m <= [r/2].

引用

页码：121 / 127

页数：7