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.
@article{arxiv.2008.03031,
title = {Characterising graphs with no subdivision of a wheel of bounded diameter},
author = {Johannes Carmesin},
journal= {arXiv preprint arXiv:2008.03031},
year = {2020}
}