  We provide an optimal sufficient condition, relating minimum degree and
bandwidth, for a graph to contain a spanning subdivision of the complete
bipartite graph $K_{2,\ell}$. This includes the containment of Hamilton paths
and cycles, and has applications in the random geometric graph model. Our proof
provides a greedy algorithm for constructing such structures.
