Pages that link to "Item:Q3393424"
From MaRDI portal
The following pages link to On the First-Fit Chromatic Number of Graphs (Q3393424):
Displaying 14 items.
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- First-fit chromatic numbers of \(d\)-degenerate graphs (Q427876) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Grundy number and products of graphs (Q968418) (← links)
- Complete colorings of planar graphs (Q1727729) (← links)
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131) (← links)
- On the family of \(r\)-regular graphs with Grundy number \(r+1\) (Q2449171) (← links)
- Inequalities for the Grundy chromatic number of graphs (Q2462396) (← links)
- New bounds on the Grundy number of products of graphs (Q2911054) (← links)
- First kind weak total chromatic numbers of graphs \(C_m\vee F_n\), \(C_m\vee W_n\) and \(C_m\vee C_n\) (Q2923709) (← links)
- Inequalities for the first-fit chromatic number (Q3528161) (← links)
- A note on the Grundy number and graph products (Q5962510) (← links)
- Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)
- Spectral upper bounds for the Grundy number of a graph (Q6658056) (← links)
