vizings_theorem (240B)
1 # Vizing's theorem 2 3 https://en.wikipedia.org/wiki/Vizing%27s_theorem 4 5 If a [graph_undirected] has [maximal_degree] d then it can be [edge_colored] with at most d+1 colors 6 7 Up: [theorem] on [edge_coloring] 8 9 See also: [graph_coloring_greedy]