Characterising graphs with no subdivision of a wheel of bounded diameter

Abstract

We prove that a graph has an r-bounded subdivision of a wheel if and only if it does not have a graph-decomposition of locality r and width at most two.