The cycle space of a 3-connected hamiltonian graph Original Research Article

S. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degree at least d has a basis consisting of cycles of length at least 2d−1. In this paper, we prove a similar result for a large class of hamiltonian graphs. We also prove a generalization of a result of I. Hartman.