3211 search results - page 1 / 643» On the Grundy Number of a Graph |

DM

2010

13 years 9 months ago
2010

The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...

IWPEC

2010

Springer

13 years 7 months ago
2010

Springer

The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...

SIAMDM

2008

13 years 9 months ago
2008

The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...

JAL

2002

13 years 9 months ago
2002

Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...

ARSCOM

2006

13 years 9 months ago
2006

The Grundy number of an impartial game G is the size of the unique Nim heap equal to G. We introduce a new variant of Nim, Restricted Nim, which restricts the number of stones a p...