We prove that if G is a k-connected (k >= 2) almost claw-free graph of order n and sigma(k+3) (G) >= n + 2k - 2, then G contains a spanning 3-ended tree, where sigma(k)(G) = min{Sigma(v is an element of S) deg(V) : S is an independent set of G with vertical bar S vertical bar = k}.
机构:
Faculty of Mathematics and Statistics, Central China Normal University
College of Mathematics and Computer Science, Wuhan Textile UniversityFaculty of Mathematics and Statistics, Central China Normal University
CHEN Yuan
CHEN GuanTao
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics and Statistics, Georgia State UniversityFaculty of Mathematics and Statistics, Central China Normal University
CHEN GuanTao
HU ZhiQuan
论文数: 0引用数: 0
h-index: 0
机构:
Faculty of Mathematics and Statistics, Central China Normal UniversityFaculty of Mathematics and Statistics, Central China Normal University
机构:
Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China
Wuhan Text Univ, Coll Math & Comp Sci, Wuhan 430073, Peoples R ChinaCent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China
Chen Yuan
Chen GuanTao
论文数: 0引用数: 0
h-index: 0
机构:
Georgia State Univ, Dept Math & Stat, Atlanta, GA 30303 USACent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China
Chen GuanTao
Hu ZhiQuan
论文数: 0引用数: 0
h-index: 0
机构:
Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R ChinaCent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China