betaFeedback

WorksMathematics

List colouring of circular-arc graphs

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.

Paper details

vlnc:W_2fcu49n5
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…