Paperlane

no. 16 · Tuesday 17 November 2026

List colouring of circular-arc graphs

Rongchuan Tao

math.CO · 5 pp

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.

comments
5 pages, 0 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.20947 ↗