Pages that link to "Item:Q856867"
From MaRDI portal
The following pages link to Results on the Grundy chromatic number of graphs (Q856867):
Displaying 41 items.
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- First-fit chromatic numbers of \(d\)-degenerate graphs (Q427876) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Grundy number and products of graphs (Q968418) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← 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)
- Transitivity on subclasses of bipartite graphs (Q2104170) (← links)
- On the Nash number and the diminishing Grundy number of a graph (Q2127607) (← links)
- Well-hued graphs (Q2166254) (← 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)
- A note on connected greedy edge colouring (Q2231754) (← links)
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs (Q2243130) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- On the family of \(r\)-regular graphs with Grundy number \(r+1\) (Q2449171) (← links)
- Inequalities for the Grundy chromatic number of graphs (Q2462396) (← links)
- On Grundy and b-chromatic number of some families of graphs: a comparative study (Q2657109) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs (Q2689124) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- New Bounds on the Grundy Number of Products of Graphs (Q2911054) (← links)
- On the Grundy Number of a Graph (Q3058701) (← links)
- Inequalities for the first-fit chromatic number (Q3528161) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← 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)
- More results on the \(z\)-chromatic number of graphs (Q6110594) (← links)
- Algorithmic study of \(d_2\)-transitivity of graphs (Q6561577) (← links)
- Algorithmic study on 2-transitivity of graphs (Q6611052) (← links)
- On \(b\)-greedy colourings and \(z\)-colourings (Q6633541) (← links)
- Upper bounds for some graph invariants in terms of blocks and cut-vertices (Q6657261) (← links)
- Spectral upper bounds for the Grundy number of a graph (Q6658056) (← links)
