Pages that link to "Item:Q1949739"

The following pages link to On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739):

Displaying 19 items.

• On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
• Dual parameterization of weighted coloring (Q786042) (← links)
• The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
• Complexity of Grundy coloring and its variants (Q1752449) (← 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)
• Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs (Q2243130) (← links)
• A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
• On the Grundy number of Cameron graphs (Q2413405) (← links)
• On the family of \(r\)-regular graphs with Grundy number \(r+1\) (Q2449171) (← links)
• On Grundy and b-chromatic number of some families of graphs: a comparative study (Q2657109) (← 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)
• A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252) (← links)
• Dual parameterization of Weighted Coloring (Q5009474) (← links)
• A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
• Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← 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)