Characterising graphs with no subdivision of a wheel of bounded diameter
Johannes Carmesin·2020-08-07·via math.CO updates on arXiv.org
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.