Hamiltonian properties of locally connected graphs with bounded vertex degree Original Research Article

We consider the existence of Hamiltonian cycles for the locally connected graphs with a bounded vertex degree. For a graph image, let image and image denote the maximum and minimum vertex degrees, respectively. We explicitly describe all connected, locally connected graphs with image. We show that every connected, locally connected graph with image and image is fully cycle extendable which extends the results of Kikust [P.B. Kikust, The existence of the Hamiltonian circuit in a regular graph of degree 5, Latvian Math. Annual 16 (1975) 33–38] and Hendry [G.R.T. Hendry, A strengthening of Kikust’s theorem, J. Graph Theory 13 (1989) 257–260] on full cycle extendability of the connected, locally connected graphs with the maximum vertex degree bounded by 5. Furthermore, we prove that problem Hamilton Cycle for the locally connected graphs with image is NP-complete.