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, and this coloring can be found in linear time. We further show that `5' is tight for every wheel graph with at least 5 vertices, and briefly discuss possible generalizations to planar graphs of treewidth 3.
翻译:滚轮图由循环构成, 和一个与循环中每个顶点连接的中心顶点组成。 在本文中我们显示, 滚轮图的每个子图都列出最多5个相配的染色号, 而这种颜色可以在线性时间中找到 。 我们还进一步显示, 至少有 5 个顶点的“ 5 ” 对每个方向图都非常紧, 并且简要地讨论 3 的平面图的概括性。