A SUFFICIENT CONDITION FOR A GRAPH TO HAVE [A,B]-FACTORS

被引：28

作者：

KANO, M ^{[1
]}

机构：

[1] AKASHI COLL TECHNOL,DEPT MATH,AKASHI 674,JAPAN

来源：

关键词：

D O I：

10.1007/BF01787576

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：245 / 251

页数：7

共 10 条

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

AKIYAMA, J ;

KANO, M .

[2] ON FACTORS WITH GIVEN COMPONENTS [J].

AMAHASHI, A ;

KANO, M .

[3]

[Anonymous], 1971, J COMBIN THEORY

[4]

Behzad M., 1979, GRAPHS DIGRAPHS

[5]

BERGE C, 1978, P K NED AKAD A MATH, V81, P165

[6]

CUI YT, 1988, J GRAPH THEOR, V12, P327

[7] A SUFFICIENT CONDITION FOR A BIPARTITE GRAPH TO HAVE A K-FACTOR [J].

ENOMOTO, H ;

OTA, K ;

KANO, M .

[8]

Lovasz Laszlo, 1970, J COMBIN THEORY B, P391

[9]

TUTTE WT, 1981, COMBINATORICA, V1, P70

[10]

Woodall D. R., 1973, Journal of Combinatorial Theory, Series B, V15, P225, DOI 10.1016/0095-8956(73)90038-5