All Subgraphs of a Wheel are 5-Coupled-Choosable
Discrete Mathematics
2021-03-12 v2 Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.2102.02918,
title = {All Subgraphs of a Wheel are 5-Coupled-Choosable},
author = {Sam Barr and Therese Biedl},
journal= {arXiv preprint arXiv:2102.02918},
year = {2021}
}
Comments
13 pages, 7 figures