Inequalities for the first-fit chromatic number
From MaRDI portal
Publication:3528161
Recommendations
Cites work
Cited in
(16)- Grundy number of corona product of some graphs
- Algorithmic study on 2-transitivity of graphs
- First-fit chromatic numbers of \(d\)-degenerate graphs
- The digrundy number of digraphs
- Results on Grundy chromatic number of join graph of graphs
- Results on the Grundy chromatic number of graphs
- On the First-Fit Chromatic Number of Graphs
- On the family of \(r\)-regular graphs with Grundy number \(r+1\)
- More results on the \(z\)-chromatic number of graphs
- Transitivity on subclasses of bipartite graphs
- First-fit colorings of graphs with no cycles of a prescribed even length
- More bounds for the Grundy number of graphs
- Algorithmic study of \(d_2\)-transitivity of graphs
- Bounds for the Grundy chromatic number of graphs in terms of domination number
- \((\delta, \chi_{\mathsf{FF}})\)-bounded families 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)