Topic: Vertex Coloring and Chromatic Number

Why Mycielski’s Construction Raises Chromatic Number

Why Mycielski Graphs Preserve Triangle-Freeness

Why Greedy Coloring Depends on Vertex Order

When the Maximum-Degree Bound Is Sharp

Using Brooks’ Theorem on Regular Graphs

The Mycielski Construction from Vertex and Edge Lists

The Maximum-Degree Plus One Bound

The Eleven-Vertex Grötzsch Graph

The Cut-Vertex Reduction in Brooks’ Theorem

Proper Vertex Colorings and Color Classes