Hamiltonian cycles in regular 3-connected claw-free graphs. (English) Zbl 0881.05084
Author’s abstract: A known result by the author [J. Nanjing Univ., Nat. Sci. Ed. 27, No. Spec. Issue, 98-105 (1991; Zbl 0762.05058)] is that every 3-connected claw-free graph on at most \(6\delta\)-11 vertices is Hamiltonian. In this paper it is proved that every 3-connected \(k\)-regular claw-free graph on at most \(7k\)-19 vertices is Hamiltonian.
Reviewer: H.Li (Orsay)
MSC:
| 05C45 | Eulerian and Hamiltonian graphs |
Citations:
Zbl 0762.05058References:
| [1] | Bondy, J. A.; Murty, U. S., Graph Theory with Application (1976), Macmillan: Macmillan New York · Zbl 1226.05083 |
| [2] | E. Flandrin, J.L. Fouquet and H. Li, On Hamiltonian claw-free graphs, preprint.; E. Flandrin, J.L. Fouquet and H. Li, On Hamiltonian claw-free graphs, preprint. · Zbl 0787.05065 |
| [3] | Jackson, B.; Zhu, Y.; Li, H., Dominating cycles in regular 3-connected graphs, Discrete Math., 102, 163-176 (1991) · Zbl 0756.05075 |
| [4] | Li, M., On Hamiltonian claw-free graphs (1991), preprint |
| [5] | Li, M., A note on circumferences of 3-connected claw-free graphs, (A special issue on Graph Theory, 27 (1991), J. Nanjing University), 98-105, MR. 93b.05094 · Zbl 0762.05058 |
| [6] | Li, M., Hamiltonian cycles in regular 2-connected claw-free graphs, (Bondy, J. A., Basic Graph Theory: Paths and Circuits (1992), North-Holland: North-Holland Amsterdam), 75 |
| [7] | Li, M., Hamiltonian cycles in 3-connected claw-free graphs, J. Graph Theory, 3, 303-313 (1993) · Zbl 0778.05056 |
| [8] | Matthews, M. M.; Sumner, D. P., Hamiltonian results in \(K_{1,3}\)-free graphs, J. Graph Theory, 8, 139-146 (1984) · Zbl 0536.05047 |
| [9] | Matthews, M. M.; Sumner, D. P., Longest paths and cycles in \(K_{1,3}\)-free graphs, J. Graph Theory, 9, 269-277 (1985) · Zbl 0591.05041 |
| [10] | Wu, Z. S., Hamilton-connectivity of \(K_{1,3}\)-free graphs, J. Math. Res. Exposition, 3, 447-451 (1989) · Zbl 0949.05509 |
| [11] | Zhang, C. Q., Hamilton cycles in \(K_{1,3}\)-free graphs, J. Graph Theory, 12, 209-216 (1988) · Zbl 0642.05037 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
