Year: 2026
Type: preprint
Abstract: A circular-arc graph takes a set of nonempty closed arcs on a circle as its vertex set, and two vertices are adjacent when their corresponding arcs intersect on the circle. We show the chromatic number of any circular-arc graph equals its list chromatic number. Our methodology is an application of Schauz's coefficient formula within the Alon-Tarsi and Combinatorial Nullstellensatz framework.
Source: arXiv (Cornell University)
Author: Tao, Rongchuan
Institution: University of Hong Kong
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234760270
