Hamilton cycles in 1-tough triangle-free graphs
文献类型：期刊论文
| 作者 | Li, XW; Wei, B; Yu, ZG; Zhu, YJ |
| 刊名 | DISCRETE MATHEMATICS
 |
| 出版日期 | 2002-06-10 |
| 卷号 | 254期号:1-3页码:275-287 |
| 关键词 | triangle-free 1-tough Hamiltonian graph |
| ISSN号 | 0012-365X |
| 英文摘要 | A graph G is called triangle-free if G has no induced K-3 as a subgraph. We set sigma(3) = min{Sigma(i=l)(3), d(v(i))\{v(1),v(2),v(3)} is an independent set of vertices in G}. In this paper, we show that if G is a 1-tough and triangle-free graph of order n with n less than or equal to sigma(3) then G is hamiltonian. (C) 2002 Elsevier Science B.V. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000176452200019 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/17911]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Wei, B |
| 作者单位 | 1.Huazhong Normal Univ, Dept Math, Wuhan 430070, Peoples R China 2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 3.Tsing Hua Univ, Dept Appl Math, Beijing 100084, Peoples R China 4.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Li, XW,Wei, B,Yu, ZG,et al. Hamilton cycles in 1-tough triangle-free graphs[J]. DISCRETE MATHEMATICS,2002,254(1-3):275-287. |
| APA | Li, XW,Wei, B,Yu, ZG,&Zhu, YJ.(2002).Hamilton cycles in 1-tough triangle-free graphs.DISCRETE MATHEMATICS,254(1-3),275-287. |
| MLA | Li, XW,et al."Hamilton cycles in 1-tough triangle-free graphs".DISCRETE MATHEMATICS 254.1-3(2002):275-287. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。