Pages that link to "Item:Q1752449"
From MaRDI portal
The following pages link to Complexity of Grundy coloring and its variants (Q1752449):
Displayed 11 items.
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← links)
- A note on connected greedy edge colouring (Q2231754) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Item:Q1752449 (redirect page) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)