KMS Of Academy of mathematics and systems sciences, CAS
Hamilton connectivity of line graphs and claw-free graphs | |
Hu, ZQ; Tian, F; Wei, B | |
2005-10-01 | |
发表期刊 | JOURNAL OF GRAPH THEORY |
ISSN | 0364-9024 |
卷号 | 50期号:2页码:130-141 |
摘要 | Let G be a graph and let V-0 = {v epsilon V(G): d(G)(v)= 6}. We show in this paper that: (1) if G is a 6-connected line graph and if vertical bar V(0)vertical bar <= 29 or G[V-0] contains at most 5 vertex disjoint K-4's, then G is Hamilton-connected; (ii) every 8-connected claw-free graph is Hamilton-connected. Several related results known before are generalized. (c) 2005 Wiley Periodicals, Inc. |
关键词 | Hamilton-connected hamiltonian cycle line graph claw-free graph spanning trail |
DOI | 10.1002/jgt.20099 |
语种 | 英语 |
WOS研究方向 | Mathematics |
WOS类目 | Mathematics |
WOS记录号 | WOS:000231913300004 |
出版者 | JOHN WILEY & SONS INC |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/1373 |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Hu, ZQ |
作者单位 | 1.Cent China Normal Univ, Fac Math & Stat, Hubei 430079, Peoples R China 2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 3.Univ Mississippi, Dept Math, University, MS 38677 USA |
推荐引用方式 GB/T 7714 | Hu, ZQ,Tian, F,Wei, B. Hamilton connectivity of line graphs and claw-free graphs[J]. JOURNAL OF GRAPH THEORY,2005,50(2):130-141. |
APA | Hu, ZQ,Tian, F,&Wei, B.(2005).Hamilton connectivity of line graphs and claw-free graphs.JOURNAL OF GRAPH THEORY,50(2),130-141. |
MLA | Hu, ZQ,et al."Hamilton connectivity of line graphs and claw-free graphs".JOURNAL OF GRAPH THEORY 50.2(2005):130-141. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
查看访问统计 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Hu, ZQ]的文章 |
[Tian, F]的文章 |
[Wei, B]的文章 |
百度学术 |
百度学术中相似的文章 |
[Hu, ZQ]的文章 |
[Tian, F]的文章 |
[Wei, B]的文章 |
必应学术 |
必应学术中相似的文章 |
[Hu, ZQ]的文章 |
[Tian, F]的文章 |
[Wei, B]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论