Abstract
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.
| Original language | English |
|---|---|
| Article number | 012069 |
| Journal | Journal of Physics: Conference Series |
| Volume | 1634 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 13 Oct 2020 |
| Event | 2020 3rd International Conference on Computer Information Science and Application Technology, CISAT 2020 - Dali, China Duration: 17 Jul 2020 → 19 Jul 2020 |
Fingerprint
Dive into the research topics of 'Hamiltonian claw-free graphs involving induced cycles'. Together they form a unique fingerprint.Cite this
Yin, J., & Xiong, L. (2020). Hamiltonian claw-free graphs involving induced cycles. Journal of Physics: Conference Series, 1634(1), Article 012069. https://doi.org/10.1088/1742-6596/1634/1/012069