SUFFICIENT CONDITIONS FOR A GRAPH TO HAVE FACTORS

被引：11
|
作者：
KANO, M
机构：
[1] Department of Mathematics, Akashi Technological College Uozumi, Akashi
来源：
DISCRETE MATHEMATICS | 1990年 / 80卷 / 02期
关键词：
D O I：
10.1016/0012-365X(90)90116-Y
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that contains given edges or does not contain any given edges, where g and f be integer-valued functions defined on the vertices of the graph. © 1990.
引用
收藏
页码：159 / 165
页数：7
相关论文
共 50 条
  • [1] More sufficient conditions for a graph to have factors
    Anstee, RP
    Nam, Y
    DISCRETE MATHEMATICS, 1998, 184 (1-3) : 15 - 24
  • [2] More Sufficient Conditions for A Graph to Have (g, f) - Factors
    Zhou, Sizhong
    Xu, Yang
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2008, 5 (01) : 15 - 20
  • [3] Sufficient Conditions for a Graph to Have All [a, b]-Factors and (a, b)-Parity Factors
    Yang, Zixuan
    Zhang, Xuechun
    Lu, Hongliang
    Lin, Yuqing
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2022, 45 (04) : 1657 - 1667
  • [4] Sufficient Conditions for a Graph to Have All [a, b]-Factors and (a, b)-Parity Factors
    Zixuan Yang
    Xuechun Zhang
    Hongliang Lu
    Yuqing Lin
    Bulletin of the Malaysian Mathematical Sciences Society, 2022, 45 : 1657 - 1667
  • [5] Sufficient conditions for component factors in a graph
    Chen, Hongzhang
    Lv, Xiaoyun
    Li, Jianxi
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2024,
  • [6] A SUFFICIENT CONDITION FOR A GRAPH TO HAVE [A,B]-FACTORS
    KANO, M
    GRAPHS AND COMBINATORICS, 1990, 6 (03) : 245 - 251
  • [7] Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path
    Momege, Benjamin
    SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2017, 10139 : 205 - 216
  • [8] Sufficient conditions for graphs to have strong parity factors
    Zhou, Sizhong
    Zhang, Yuli
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (05) : 2465 - 2471
  • [9] Sufficient conditions for graphs to have (g,f)-factors
    Egawa, Y
    Kano, M
    DISCRETE MATHEMATICS, 1996, 151 (1-3) : 87 - 90
  • [10] Spectral sufficient conditions for graph factors containing any edge
    Cai, Jin
    Zhou, Bo
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (05) : 3859 - 3870
12345