Pages that link to "Item:Q2243130"
From MaRDI portal
The following pages link to Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs (Q2243130):
Displaying 12 items.
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Characterization of \(b\gamma\)-perfect graphs (Q1928629) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← 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)
- 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)
- (Q4584199) (← links)
- More results on the \(z\)-chromatic number of graphs (Q6110594) (← links)
