On the Grundy Number of a Graph

13 years 2 months ago

Download ftp-sop.inria.fr

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 according to some

Frédéric Havet, Leonardo Sampaio

Real-time Traffic

Applied Computing | Colours | Greedy Algorithm | Grundy Number | IWPEC 2010 |

claim paper

Related Content

» Grundy number and products of graphs

» On the FirstFit Chromatic Number of Graphs

» Kayles and Nimbers

» Fractal Sequences and Restricted Nim

» On crossing numbers of geometric proximity graphs

» Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs

» On directed local chromatic number shift graphs and Borsuklike graphs

» Weak Borel chromatic numbers

» Lower bounds on the obstacle number of graphs

Post Info
More Details (n/a)

Added	14 Feb 2011
Updated	14 Feb 2011
Type	Journal
Year	2010
Where	IWPEC
Authors	Frédéric Havet, Leonardo Sampaio

Comments (0)

Sciweavers

On the Grundy Number of a Graph

Applied Computing | Colours | Greedy Algorithm | Grundy Number | IWPEC 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers