Chromatic Number
-
A graph with maximum degree \(k\) must have a chromatic number \(\geq k\).
Consider the \(n\)-vertex star graph. The central vertex has degree \(n-1\) but the graph is still 2-colorable. -
What is the chromatic number for a Wheel graph with \(n\) vertices, where \(n\) is even?
-
How many colors do you need to color a complete graph with \(n\) vertices?