Affiliation:
1. College of Science, Liaoning University of Technology, Jinzhou 121001, China
Abstract
We prove that ifGis ak-connected (k≥2) almost claw-free graph of ordernandσk+3(G)≥n+2k-2, thenGcontains a spanning 3-ended tree, whereσk(G)=min{∑v∈Sdeg(v):Sis an independent set ofGwithS=k}.
Funder
National Natural Science Foundation of China
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献