Pages that link to "Item:Q3490012"
From MaRDI portal
The following pages link to On the equality of the grundy and ochromatic numbers of a graph (Q3490012):
Displayed 11 items.
- First-fit chromatic numbers of \(d\)-degenerate graphs (Q427876) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- Greedy rankings and arank numbers (Q989495) (← links)
- Greedy \(F\)-colorings of graphs (Q1415540) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- The digrundy number of digraphs (Q2142695) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- An algorithm for partial Grundy number on trees (Q2576842) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)