Inequalities for the first-fit chromatic number
From MaRDI portal
Publication:3528161
DOI10.1002/JGT.20327zbMATH Open1157.05023OpenAlexW4236316018MaRDI QIDQ3528161FDOQ3528161
Authors: András Gyárfás, Gábor N. Sárközy, Zoltán Füredi, Stanley 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
Recommendations
bipartite graphfirst-fit chromatic numberNordhaus-Gaddum inequalitymulticolored graphGrundy chromatic number
Cites Work
Cited In (16)
- Transitivity on subclasses of bipartite graphs
- Algorithmic study of \(d_2\)-transitivity of graphs
- On the First-Fit Chromatic Number of Graphs
- Bounds for the Grundy chromatic number of graphs in terms of domination number
- First-fit chromatic numbers of \(d\)-degenerate graphs
- On the family of \(r\)-regular graphs with Grundy number \(r+1\)
- Results on the Grundy chromatic number of graphs
- \((\delta, \chi_{\mathsf{FF}})\)-bounded families of graphs
- Algorithmic study on 2-transitivity of graphs
- The digrundy number of digraphs
- Grundy number of corona product of some graphs
- First-fit colorings of graphs with no cycles of a prescribed even length
- Results on Grundy chromatic number of join graph of graphs
- More results on the \(z\)-chromatic number of graphs
- More bounds for the Grundy number of graphs
- Inequalities for the Grundy chromatic number of graphs
This page was built for publication: Inequalities for the first-fit chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528161)