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

被引：28
作者：
KANO, M [1 ]
机构：
[1] AKASHI COLL TECHNOL,DEPT MATH,AKASHI 674,JAPAN
来源：
GRAPHS AND COMBINATORICS | 1990年 / 6卷 / 03期
关键词：
D O I：
10.1007/BF01787576
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We give a sufficient condition by using neighborhoods for a graph to have [a, b]-factors. © 1990 Springer-Verlag.
引用
收藏
页码：245 / 251
页数：7
相关论文
共 10 条
  • [1] FACTORS AND FACTORIZATIONS OF GRAPHS - A SURVEY
    AKIYAMA, J
    KANO, M
    [J]. JOURNAL OF GRAPH THEORY, 1985, 9 (01) : 1 - 42
  • [2] ON FACTORS WITH GIVEN COMPONENTS
    AMAHASHI, A
    KANO, M
    [J]. DISCRETE MATHEMATICS, 1982, 42 (01) : 1 - 6
  • [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
    ENOMOTO, H
    OTA, K
    KANO, M
    [J]. JOURNAL OF GRAPH THEORY, 1988, 12 (01) : 141 - 151
  • [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
1