## On some intriguing problems in hamiltonian graph theory--a survey

- Hajo Broersma
- Discrete Mathematics
- 2002

Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Zhu and Li showed that the upper bound 3k on n can be relaxed to q k if G is 3-connected and k 2 63. We improve both results by showing that G is hamiltonian if n 5 gk 7 and G does not belong to a restricted class 3 of nonhamiltonian graphs of connectivity 2… (More)

Sorry, we couldn't extract any figures or tables for this paper.