Pages that link to "Item:Q5363791"

The following pages link to B-chromatic number: Beyond NP-hardness (Q5363791):

Displaying 12 items.

• On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
• Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
• \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
• The b-chromatic number of a graph (Q1283791) (← links)
• On approximating the b-chromatic number (Q1765381) (← links)
• A note on approximating the \(b\)-chromatic number (Q1949121) (← links)
• A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
• The \(b\)-chromatic index of graphs (Q2352073) (← links)
• Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
• Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
• Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
• Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)