Inequalities for the first-fit chromatic number
From MaRDI portal
Publication:3528161
DOI10.1002/jgt.20327zbMath1157.05023MaRDI QIDQ3528161
Gábor N. Sárközy, András Gyárfás, Zoltan Fueredi, Stanley M. Selkow
Publication date: 8 October 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20327
bipartite graph; first-fit chromatic number; Nordhaus-Gaddum inequality; multicolored graph; Grundy chromatic number
05C15: Coloring of graphs and hypergraphs
Related Items
First-fit colorings of graphs with no cycles of a prescribed even length, First-fit chromatic numbers of \(d\)-degenerate graphs, More bounds for the Grundy number of graphs, Results on the Grundy chromatic number of graphs, On the family of \(r\)-regular graphs with Grundy number \(r+1\), Inequalities for the Grundy chromatic number of graphs
Cites Work