Topic: Vertex Coloring and Chromatic Number

Large Chromatic Number with Small Clique Number

Iterating Mycielski’s Construction

Greedy Coloring by Vertex Order

Computing the Mycielski Graph of K2

Common Errors in Vertex-Coloring Arguments

Coloring Trees by Alternating Levels

Coloring Complete Bipartite Graphs

Clique Number as a Lower Bound on Chromatic Number

Chromatic Numbers of Complete Graphs

Chromatic Numbers of Paths and Cycles