Connected Factors in K1,n-free Graphs Containing a (g, f)-factor

被引：0
作者：
Baoguang Xu
Zhenhong Liu
Taro Tokuda
机构：
[1] Institute of Systems Science,
[2] Academia Sinica,undefined
[3] Beijing,undefined
[4] P.R.C. 100080,undefined
[5] Department of Mathematics,undefined
[6] Faculty of Science and Technology,undefined
[7] Keio University,undefined
[8] 3-14-1 Hiyoshi,undefined
[9] Kohoku-ku,undefined
[10] Yokohama 223-8522,undefined
[11] Japan,undefined
来源：
Graphs and Combinatorics | 1998年 / 14卷 / 4期
关键词：
D O I：
10.1007/PL00021186
中图分类号：
学科分类号：
摘要：
Let G be a connected K1,n-free graph (n≥3), f and g be positive integer-valued functions defined on V(G) with g(v)≤f(v) for all v∈V(G). We prove that G contains a connected (g,f+n−1)-factor if G has a (g,f)-factor. This result is sharp from the point of view that there exists a connected K1,n-free graph which has a (g,f)-factor but no connected (g,f+n−2)-factor for all pairs of positive integer-valued functions g and f with g=f.
引用
收藏
页码：393 / 395
页数：2
相关论文
共 50 条
[41]   Spanning 3-ended trees in k-connected K1,4-free graphs [J].
Yuan Chen ;
GuanTao Chen ;
ZhiQuan Hu .
Science China Mathematics, 2014, 57 :1579-1586
[42]   3-Connected {K1,3, P9}-Free Graphs are Hamiltonian-Connected [J].
Qiuju Bian ;
Ronald J. Gould ;
Paul Horn ;
Susan Janiszewski ;
Steven La Fleur ;
Paul Wrayno .
Graphs and Combinatorics, 2014, 30 :1099-1122
[43]   Connected graph G with σ2(G) ≥ 2/3n in and K1,4-free contains a Hamiltonian path [J].
Momege, Benjamin .
DISCRETE APPLIED MATHEMATICS, 2018, 247 :37-42
[44]   CONNECTED [1, k]-FACTORS OF BALANCE BIPARTITE GRAPHS [J].
XU RuiDepartment of Mathematics Shandong University Jinan China .
SystemsScienceandMathematicalSciences, 1999, (02) :149-153
[45]   Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes [J].
Aharoni, Ron ;
Alon, Noga ;
Berger, Eli .
JOURNAL OF GRAPH THEORY, 2016, 83 (04) :384-391
[46]   Vertex-disjoint K1 + (K1 ∪ K2) in K1,4-free graphs with minimum degree at least four [J].
Yun Shu Gao ;
Qing Song Zou .
Acta Mathematica Sinica, English Series, 2014, 30 :661-674
[47]   The stability number and connected [k, k+1]-factor in graphs [J].
Cai, Jiansheng ;
Liu, Guizhen ;
Hou, Jianfeng .
APPLIED MATHEMATICS LETTERS, 2009, 22 (06) :927-931
[48]   Pancyclicity of 4-Connected {K1,3,Z8}-Free Graphs [J].
Lai, Hong-Jian ;
Zhan, Mingquan ;
Zhang, Taoye ;
Zhou, Ju .
GRAPHS AND COMBINATORICS, 2019, 35 (01) :67-89
[49]   A note on Hamiltonian cycles in K1,r-free graphs [J].
Li, R .
ARS COMBINATORIA, 1999, 51 :199-203
[50]   ON 1-FACTORS OF N-CONNECTED GRAPHS [J].
ZAKS, JY .
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 16 (04) :649-&
12345