Pages that link to "Item:Q2462396"
From MaRDI portal
The following pages link to Inequalities for the Grundy chromatic number of graphs (Q2462396):
Displaying 10 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)
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- The potential of greed for independence (Q4650180) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← 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)
