A wheel graph consists of a cycle along with a center vertex connected to every vertex in the cycle. In this paper we show that every subgraph of a wheel graph has list coupled chromatic number at most 5. We further show that this bound is tight for every wheel graph with at least 5 vertices.

https://link.springer.com/chapter/10.1007/978-3-030-79987-8_6