If G is a graph which induces neither K1,3 nor K5-e and if Δ(G)≤2ω(G)-5, then χ(G) = ω(G). Conversely, for each k ≥ 4 there is a graph G which induces neither K1,3 nor K5-e such that ω(G) = k, Δ(G) = 2k - 3 and χ(G) = k + 1.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics