The following pages link to (Q4659607):
Displayed 19 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)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- Transitivity on subclasses of bipartite graphs (Q2104170) (← links)
- A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Inequalities for the Grundy chromatic number of graphs (Q2462396) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Grundy number on -classes (Q2840510) (← links)
- Restricted coloring problems on graphs with few (Q2840684) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- A note on the Grundy number and graph products (Q5962510) (← links)
- More results on the \(z\)-chromatic number of graphs (Q6110594) (← links)
- Grundy number of corona product of some graphs (Q6184224) (← links)