Abstract

Let G be a graph and χ l ( G ) denote the list chromatic number of G . In this paper we prove that for every graph G for which the length of each cycle is divisible by l ( l ≥ 3 ), χ l ( G ) ≤ 3 .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call