Topic: Edge Coloring

Kőnig’s Line Coloring Theorem

Exact Edge-Coloring Numbers of Paths and Cycles

Edge Chromatic Number and the Maximum-Degree Bound

Constructing Optimal Bipartite Edge Colorings

Common Errors in Edge-Coloring Arguments

Combining Fans With Two-Color Chains

Classifying Edge Chromatic Numbers by Worked Examples

Class One and Class Two Graphs

Bipartite Edge Coloring and Degree-Based Bounds

Applying Vizing’s Fan Recoloring Procedure