Pages that link to "Item:Q1949739"

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

Displaying 28 items.

• A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759) (← links)
• On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
• Dual parameterization of weighted coloring (Q786042) (← links)
• Results on the Grundy chromatic number of graphs (Q856867) (← links)
• The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
• Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs (Q1683560) (← links)
• Complexity of Grundy coloring and its variants (Q1752449) (← links)
• On partial Grundy coloring of bipartite graphs and chordal graphs (Q2009016) (← links)
• On the Nash number and the diminishing Grundy number of a graph (Q2127607) (← links)
• \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← 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)
• 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)
• 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)
• \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
• On \(b\)-greedy colourings and \(z\)-colourings (Q6633541) (← links)