Browsing Combinatorics and Optimization by Subject "Reed's Conjecture"
Now showing items 1-1 of 1
-
Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm
(University of Waterloo, 2019-08-09)Many of the most celebrated and influential results in graph coloring, such as Brooks' Theorem and Vizing's Theorem, relate a graph's chromatic number to its clique number or maximum degree. Currently, several of the most ...