Graph Coloring You Can See

Graph coloring is the computational task of assigning colors to graph elements so no adjacent elements share the same color, with applications in scheduling and cartography. The content explores node, edge, and face coloring, providing visual intuition through a new Python library called GCol, which is built on NetworkX. It presents code examples and detailed visualizations for various graphs, such as the dodecahedral graph and bipartite graphs. Key theoretical concepts are also discussed, including Vizing's theorem for edge coloring and the famous four-color theorem for face coloring.