Pages that link to "Item:Q2462396"
From MaRDI portal
The following pages link to Inequalities for the Grundy chromatic number of graphs (Q2462396):
Displaying 20 items.
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- Inequalities between the domination number and the chromatic number of a graph (Q1121277) (← links)
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131) (← links)
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs (Q2243130) (← links)
- Rank inequalities for chordal graphs (Q2366014) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- An inequality for the group chromatic number of a graph (Q2462377) (← links)
- Inequalities involving the irredundance number of a graph (Q2576844) (← links)
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs (Q2689124) (← links)
- (Q3363325) (← links)
- Inequalities for the first-fit chromatic number (Q3528161) (← links)
- The potential of greed for independence (Q4650180) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- A lower bound for approximating the Grundy number (Q5387684) (← links)
- (Q5874480) (← links)
- Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)
- A survey on the Intersection graphs of ideals of rings (Q6101486) (← links)
