grundy_number (369B)
1 # Grundy number 2 3 The *Grundy number* of an [undirected_graph] is the highest number of colors that are used when coloring [vertices] using a [greedy_algorithm], across all possible orders in which vertices can be considered 4 5 A [graph] is [graph_well_colored] if its [chromatic_number] is equal to its [Grundy_number] 6 7 Up: [graph_coloring] 8 9 See also: [chromatic_number]