ON SOME FACTOR THEOREMS OF GRAPHS

被引：8

作者：

CAI, MC

机构：

[1] Institute of Systems Science, Academia Sinica, Beijing

来源：

关键词：

D O I：

10.1016/0012-365X(91)90378-F

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The aim of this note is to show that some recently published results on graph factors derive fairly easily from Lovasz' (g,f)-factor theorems.

引用

页码：223 / 229

页数：7

共 13 条

[1] ON FACTORS WITH ALL DEGREES ODD [J].

AMAHASHI, A .

[2]

Bollobas B., 1978, LONDON MATH SOC MONO

[3] [A,B]-FACTORIZATION OF A GRAPH [J].

KANO, M .

[4]

LASVERGNAS M, 1972, DISCRETE MATH, V2, P241

[5] FACTORIZATION OF GRAPHS .2. [J].

LOVASZ, L .

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1972, 23 (1-2) :223-246

[6]

Lovasz L., 1985, MATCHING THEORY

[7]

Lovasz Laszlo, 1970, J COMBIN THEORY B, P391

[8]

ORE O, 1952, T AM MATH SOC, V4, P314

[9]

QI N, 1987, OPER RES LETT, V6, P135, DOI 10.1016/0167-6377(87)90027-7

[10]

Tutte William Thomas, 1984, GRAPH THEORY