If H is any graph of order n with k non-trivial components, each of which contains at most one cycle, then every graph of order at least n and minimum degree at least n - k contains a subdivision of H such that only edges contained in a cycle in H are subdivided. © 2008 Springer Japan.