|
个人信息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
Spanning eulerian subgraphs in N-2-locally connected claw-free graphs
点击次数：
论文类型：期刊论文
发表时间：2010-01-01
发表刊物：ARS COMBINATORIA
收录刊物：SCIE、Scopus
卷号：94
页面范围：191-199
ISSN号：0381-7032
摘要：A graph G is N-m-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. In this note, we first present a counterexample to the conjecture that every 3-connected, N-2-locally connected claw-free graph is hamiltonian and then show that both connected N-2-locally connected claw-free graph and connected N-3-locally connected claw-free graph with minimum degree at least three have connected even [2, 4]-factors.