Work

List colouring of circular-arc graphs

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.
Language: English
Open Access status: green
OpenAlex ID: W7234760270
Cites: 8
Cited by:
Related to: 10