Online coloring a token graph
Kevin G. Milans, Michael C. Wigal

TL;DR
This paper investigates an online graph coloring game involving token placement and coloring, characterizes online-perfect graphs, and explores the complexity of the minimum colors needed in non-perfect cases.
Contribution
It provides a forbidden induced subgraph characterization of online-perfect graphs and analyzes the asymptotic behavior of the coloring function for non-perfect graphs.
Findings
Characterization of online-perfect graphs via forbidden subgraphs
Asymptotic analysis of the minimum colors for certain non-perfect graphs
Open problem related to online coloring on the real line
Abstract
We study a combinatorial coloring game between two players, Spoiler and Algorithm, who alternate turns. First, Spoiler places a new token at a vertex in , and Algorithm responds by assigning a color to the new token. Algorithm must ensure that tokens on the same or adjacent vertices receive distinct colors. Spoiler must ensure that the token graph (in which two tokens are adjacent if and only if their distance in is at most ) has chromatic number at most . Algorithm wants to minimize the number of colors used, and Spoiler wants to force as many colors as possible. Let be the minimum number of colors needed in an optimal Algorithm strategy. A graph is online-perfect if . We give a forbidden induced subgraph characterization of the class of online-perfect graphs. When is not online-perfect, determining seems challenging; we establish…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
