Pages that link to "Item:Q1752449"
From MaRDI portal
The following pages link to Complexity of Grundy coloring and its variants (Q1752449):
Displaying 20 items.
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← 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)
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Grundy number on \(P_4\)-classes (Q2840510) (← links)
- (Q3196376) (redirect page) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- A lower bound for approximating the Grundy number (Q5387684) (← links)
- (Q5874480) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- The complexity of grid coloring (Q6109067) (← links)
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly (Q6599810) (← links)
