Grundy number
In graph theory, the Grundy number or Grundy chromatic number of an undirected graph is the maximum number of colors that can be used by a greedy coloring strategy that considers the vertices of the graph in sequence and assigns each vertex its first available color, using a vertex ordering chosen to use as many colors as possible. Grundy numbers are named after P. M. Grundy, who studied an analogous concept for directed graphs in 1939. The undirected version was introduced by .
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
Grundy number
In graph theory, the Grundy number or Grundy chromatic number of an undirected graph is the maximum number of colors that can be used by a greedy coloring strategy that considers the vertices of the graph in sequence and assigns each vertex its first available color, using a vertex ordering chosen to use as many colors as possible. Grundy numbers are named after P. M. Grundy, who studied an analogous concept for directed graphs in 1939. The undirected version was introduced by .
has abstract
In graph theory, the Grundy nu ...... ed version was introduced by .
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
951,281,259
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In graph theory, the Grundy nu ...... ed version was introduced by .
@en
label
Grundy number
@en