graph_coloring_greedy (219B)
1 # Graph coloring greedy 2 3 If an [undirected_graph] has [maximal_degree] d then it has a coloring with d+1 colors at most 4 - simple [greedy_algorithm] 5 6 Up: [graph_coloring], [greedy_algorithm] 7 8 See also: [vizings_theorem]