On the First-Fit Chromatic Number of Graphs
From MaRDI portal
Recommendations
- First-fit chromatic numbers of \(d\)-degenerate graphs
- scientific article; zbMATH DE number 4170931
- Inequalities for the first-fit chromatic number
- On the chromatic number of graphs
- scientific article; zbMATH DE number 77956
- On the total set chromatic number of graphs
- On chromaticity of graphs
- scientific article; zbMATH DE number 773170
- scientific article; zbMATH DE number 3245178
- scientific article; zbMATH DE number 4128832
Cited in
(18)- Complete colorings of planar graphs
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
- On the family of \(r\)-regular graphs with Grundy number \(r+1\)
- Inequalities for the Grundy chromatic number of graphs
- New bounds on the Grundy number of products of graphs
- First kind weak total chromatic numbers of graphs C_m F_n, C_m W_n and C_m C_n
- \((\delta, \chi_{\mathsf{FF}})\)-bounded families of graphs
- First-fit colorings of graphs with no cycles of a prescribed even length
- Inequalities for the first-fit chromatic number
- First-fit chromatic numbers of \(d\)-degenerate graphs
- First-fit coloring of Cartesian product graphs and its defining sets
- First-fit coloring of bounded tolerance graphs
- A note on the Grundy number and graph products
- Bounds for the Grundy chromatic number of graphs in terms of domination number
- Results on Grundy chromatic number of join graph of graphs.
- Spectral upper bounds for the Grundy number of a graph
- First-fit coloring of forests in random arrival model
- Grundy number and products of graphs
This page was built for publication: On the First-Fit Chromatic Number of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393424)
