Pages that link to "Item:Q284759"

The following pages link to A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs (Q284759):

Displaying 11 items.

• On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
• A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← 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 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 note on induced subtrees and chromatic number of graphs (Q5063847) (← links)
• More results on the \(z\)-chromatic number of graphs (Q6110594) (← links)
• \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
• Spectral upper bounds for the Grundy number of a graph (Q6658056) (← links)