Inequalities for the first-fit chromatic number

DOI10.1002/jgt.20327zbMath1157.05023OpenAlexW4236316018MaRDI 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

zbMATH Keywords

bipartite graphfirst-fit chromatic numberNordhaus-Gaddum inequalitymulticolored graphGrundy chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

The digrundy number of digraphs ⋮ First-fit colorings of graphs with no cycles of a prescribed even length ⋮ Results on the Grundy chromatic number of graphs ⋮ Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ More results on the \(z\)-chromatic number of graphs ⋮ Grundy number of corona product of some graphs ⋮ First-fit chromatic numbers of \(d\)-degenerate graphs ⋮ On the family of \(r\)-regular graphs with Grundy number \(r+1\) ⋮ Inequalities for the Grundy chromatic number of graphs ⋮ More bounds for the Grundy number of graphs ⋮ Transitivity on subclasses of bipartite graphs

Cites Work

• Unnamed Item
• Results on the Grundy chromatic number of graphs
• On Complementary Graphs
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts

This page was built for publication: Inequalities for the first-fit chromatic number