摘要
The hamiltonian problem is an important topic in structural graph theory, which is closely related to Four Color Problem. Hence lots of graph scholars are dedicated to this topic. There are many authors working for finding some sufficient conditions for hamiltonian property of graphs. Let G be a claw-free graph with n vertices and δ(G)≥3. In this paper, we show that if G has an induced cycle of length more than (4n - 2δ(G)-4)(δ(G)+2)-1, then G is hamiltonian. The result is best possible if δG is 3 or 4.
| 源语言 | 英语 |
|---|---|
| 文章编号 | 012069 |
| 期刊 | Journal of Physics: Conference Series |
| 卷 | 1634 |
| 期 | 1 |
| DOI | |
| 出版状态 | 已出版 - 13 10月 2020 |
| 活动 | 2020 3rd International Conference on Computer Information Science and Application Technology, CISAT 2020 - Dali, 中国 期限: 17 7月 2020 → 19 7月 2020 |
指纹
探究 'Hamiltonian claw-free graphs involving induced cycles' 的科研主题。它们共同构成独一无二的指纹。引用此
Yin, J., & Xiong, L. (2020). Hamiltonian claw-free graphs involving induced cycles. Journal of Physics: Conference Series, 1634(1), 文章 012069. https://doi.org/10.1088/1742-6596/1634/1/012069