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 条
[21]   Binding Number and Connected ( g, f+1)-factors in graphs [J].
Cai, Jiansheng ;
Liu, Guizhen ;
Hou, Jianfeng .
COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 :313-+
[22]   CONNECTED, LOCALLY 2-CONNECTED, K1,3-FREE GRAPHS ARE PANCONNECTED [J].
KANETKAR, SV ;
RAO, PR .
JOURNAL OF GRAPH THEORY, 1984, 8 (03) :347-353
[23]   Connected [k, k + 1]-factors of graphs 1 [J].
Institute of Systems Science, Academia Sinica, Beijing 100080, China .
Discrete Math, 1-3 (1-16)
[24]   Hamiltonicity of 2-connected {K1,4, K1,4 + e]-free graphs [J].
Li, R .
DISCRETE MATHEMATICS, 2004, 287 (1-3) :69-76
[25]   A Note on 4-connected Planar K1,1,5-minor-free Graphs [J].
Xu, Yuqi ;
Yang, Weihua ;
Zhao, Shuang .
GRAPHS AND COMBINATORICS, 2025, 41 (04)
[26]   A characterization of 2-connected {K1,3, N3,1,1}-free non-Hamiltonian graphs [J].
Chiba, Shuya ;
Furuya, Michitaka .
DISCRETE MATHEMATICS, 2021, 344 (05)
[27]   Spanning trees with at most k leaves in 2-connected K1,r-free graphs [J].
Chen, Guantao ;
Chen, Yuan ;
Hu, Zhiquan ;
Zhang, Shunzhe .
APPLIED MATHEMATICS AND COMPUTATION, 2023, 445
[28]   On Ramsey (K1,m, g)-minimal graphs [J].
Borowiecka-Olszewska, Marta ;
Haluszczak, Mariusz .
DISCRETE MATHEMATICS, 2013, 313 (19) :1843-1855
[29]   Connected [k,k+1]-factors of graphs [J].
Cai, MC .
DISCRETE MATHEMATICS, 1997, 169 (1-3) :1-16
[30]   LONGEST CYCLES IN KAPPA-CONNECTED K1,3-FREE GRAPHS [J].
WU, ZS .
KEXUE TONGBAO, 1988, 33 (04) :350-350
12345