Toughness and the existence of k-factors. III

被引：13
|
作者：
Enomoto, H [1 ]
机构：
[1] Keio Univ, Dept Math, Kohoku Ku, Yokohama, Kanagawa 223, Japan
来源：
DISCRETE MATHEMATICS | 1998年 / 189卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(98)00059-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In a paper with the same title (Enomoto et al., 1985) we proved Chvatal's conjecture that k-tough graphs have k-factors if they satisfy trivial necessary conditions. In this paper, we introduce a variation of toughness, and prove a stronger result for the existence of 1- or 2-factors. This solves a conjecture of Liu and Yu, affirmatively. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：277 / 282
页数：6
相关论文
共 50 条
  • [1] Toughness and the existence of k-factors.: IV
    Enomoto, H
    Hagita, M
    [J]. DISCRETE MATHEMATICS, 2000, 216 (1-3) : 111 - 120
  • [2] TOUGHNESS AND THE EXISTENCE OF K-FACTORS
    ENOMOTO, H
    JACKSON, B
    KATERINIS, P
    SAITO, A
    [J]. JOURNAL OF GRAPH THEORY, 1985, 9 (01) : 87 - 95
  • [3] Toughness for the existence of k-Hamiltonian [a, b]-factors
    Zhou, Sizhong
    Xu, Yang
    Yang, Fan
    [J]. ARS COMBINATORIA, 2017, 135 : 153 - 161
  • [4] TOUGHNESS AND THE EXISTENCE OF K-FACTORS .2.
    ENOMOTO, H
    [J]. GRAPHS AND COMBINATORICS, 1986, 2 (01) : 37 - 42
  • [5] Toughness and the existence of fractional k-factors of graphs
    Liu, Guizhen
    Zhang, Lanju
    [J]. DISCRETE MATHEMATICS, 2008, 308 (09) : 1741 - 1748
  • [6] TOUGHNESS OF GRAPHS AND THE EXISTENCE OF FACTORS
    KATERINIS, P
    [J]. DISCRETE MATHEMATICS, 1990, 80 (01) : 81 - 92
  • [7] Isolated toughness and existence of f-factors
    Ma, Yinghong
    Yu, Qinglin
    [J]. DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 120 - +
  • [8] Toughness and the existence of Hamiltonian [a, b]-factors of graphs
    Zhou, Sizhong
    [J]. UTILITAS MATHEMATICA, 2013, 90 : 187 - 197
  • [9] TOUGHNESS, MINIMUM DEGREE, AND THE EXISTENCE OF 2-FACTORS
    BAUER, D
    SCHMEICHEL, E
    [J]. JOURNAL OF GRAPH THEORY, 1994, 18 (03) : 241 - 256
  • [10] A toughness condition for the existence of f-factors in graphs
    [J]. Cai, J. (healthcai@163.com), 2012, Charles Babbage Research Centre (83):
12345