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 条
  • [21] Some sufficient conditions for a graph to be of Cf 1
    Zhang, X
    Liu, GZ
    APPLIED MATHEMATICS LETTERS, 2006, 19 (01) : 38 - 44
  • [22] A SUFFICIENT CONDITION FOR A BIPARTITE GRAPH TO HAVE A K-FACTOR
    ENOMOTO, H
    OTA, K
    KANO, M
    JOURNAL OF GRAPH THEORY, 1988, 12 (01) : 141 - 151
  • [23] Sufficient conditions for the existence of a graph with a given variety of balls
    Rychkov K.L.
    Journal of Applied and Industrial Mathematics, 2007, 1 (3) : 380 - 385
  • [24] On sufficient degree conditions for a graph to be k-linked
    Kawarabayashi, Ken-Ichi
    Kostochka, Alexandr
    Yu, Gexin
    COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (05): : 685 - 694
  • [25] Sufficient Conditions for Flocking via Graph Robustness Analysis
    Martin, Samuel
    Girard, Antoine
    49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, : 6293 - 6298
  • [26] Some spectral sufficient conditions for a graph being pancyclic
    Xu, Huan
    Yu, Tao
    Alsaadi, Fawaz E.
    Alassafi, Madini Obad
    Yu, Guidong
    Cao, Jinde
    AIMS MATHEMATICS, 2020, 5 (06): : 5389 - 5401
  • [27] COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH
    Abrosimov, M. B.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2019, (45): : 55 - 63
  • [28] NECESSARY AND SUFFICIENT CONDITIONS FOR R-GRAPH SYNTHESIS
    BROWN, DP
    REED, MB
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1962, 273 (06): : 472 - &
  • [29] SUFFICIENT CONDITIONS FOR EQUALITY OF CONNECTIVITY AND MINIMUM DEGREE OF A GRAPH
    TOPP, J
    VOLKMANN, L
    JOURNAL OF GRAPH THEORY, 1993, 17 (06) : 695 - 700
  • [30] SOME SUFFICIENT CONDITIONS FOR GROUPS TO HAVE ONE END
    HOUGHTON, CH
    SEGAL, D
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1975, 10 (MAY): : 89 - 96
12345