A generalization of Dirac's theorem: Subdivisions of wheels

In this paper, we prove that if every vertex of a simple graph has degree at least δ, then it has a subgraph that is isomorphic to a subdivision of a δ-wheel. We then extend a result of Dirac showing that every graph with a chromatic number exceeding n has a subgraph that is a subdivision of the n-wheel.