Pages that link to "Item:Q340565"
From MaRDI portal
The following pages link to On the parameterized complexity of b-\textsc{chromatic number} (Q340565):
Displaying 8 items.
- 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)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
- B-chromatic number: Beyond NP-hardness (Q5363791) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)