A circular-arc graph is an intersection graph of a finite family of nonempty closed circular arcs on a common circle. Each graph vertex represents an arc, and two distinct vertices are adjacent vertices iff the corresponding arcs intersect (Tucker 1975, Tao 2026).
Every interval graph is a circular-arc graph, by mapping its interval representation onto a proper arc of a circle. The converse fails. For example, cycle graphs of length at least 4 have circular-arc representations but are not interval graphs.
Tao (2026) proved that every finite circular-arc graph
satisfies
where
is its choice number and
is its chromatic number.