|
个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职：Director of Academic Committee at Kaifa District
其他任职：开发区校区学术分委员会主任（Director of Academic Committee at Kaifa Campus）
性别：男
毕业院校：多伦多大学
学位：博士
所在单位：软件学院、国际信息与软件学院
学科：软件工程. 运筹学与控制论
办公地点：开发区（Kaifa District Campus）
联系方式：mingchul@dlut.edu.cn
电子邮箱：mingchul@dlut.edu.cn
Hamiltonian properties of almost locally connected claw-free graphs
点击次数：
论文类型：期刊论文
发表时间：2016-01-01
发表刊物：ARS COMBINATORIA
收录刊物：SCIE
卷号：124
页面范围：95-109
ISSN号：0381-7032
关键字：almost locally connected; claw-free graph; hamiltonian; Hamilton-connected
摘要：G is almost locally connected if B(G) is an independent set and for any x is an element of B(G), there is a vertex y in V(G)\{x} such that N(x) boolean OR {y} induces a connected subgraph of G, where B(G) denotes the set of vertices of G that are not locally connected. In this paper, we prove that an almost locally connected claw-free graph on at least 4 vertices is Hamilton-connected if and only if it is 3-connected. This generalizes a result by Asratian that a locally connected claw-free graph on at least 4 vertices is Hamilton-connected if and only if it is 3-connected [Journal of Graph Theory 23 (1996) 191-201].