Demystify Graph Coloring Algorithms
Solve edge coloring, map coloring, and other fun problems
Published in
6 min readJan 21, 2021
Graph coloring is a problem where certain colors are assigned to a particular constraint in a graph. For instance, it could be that you must color a graph, either vertices or edges, so that no two identical colors are adjacent to each other — no two adjacent vertices or edges will have the same color.
