  A wheel is a graph consisting of an induced cycle of length at least four and
a single additional vertex with at least three neighbours on the cycle. We
prove that no Burling graph contains an induced wheel. Burling graphs are
triangle-free and have arbitrarily large chromatic number, so this answers a
question of Trotignon and disproves a conjecture of Scott and Seymour.
