Inequalities for the Grundy chromatic number of graphs

Authors:
Manouchehr Zaker
Affiliations:
Institute for Advanced Studies in Basic Sciences, Zanjan, Iran
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 3
Cited 1

The linearity of first-fit coloring of interval graphs

SIAM Journal on Discrete Mathematics
The greedy algorithm is optimal for on-line edge coloring

Information Processing Letters
On-Line and First-Fit Coloring of Graphs That Do Not Induce $P_5$

SIAM Journal on Discrete Mathematics

The potential of greed for independence

Journal of Graph Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

The Grundy (or First-Fit) chromatic number of a graph G is the maximum number of colors used by the First-Fit coloring of the graph G. In this paper we give upper bounds for the Grundy number of graphs in terms of vertex degrees, girth, clique partition number and for the line graphs. Next we show that if the Grundy number of a graph is large enough then the graph contains a subgraph of prescribed large girth and Grundy number.