Pages that link to "Item:Q2310757"
From MaRDI portal
The following pages link to A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757):
Displaying 6 items.
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- On the complexity of computing the excessive \([B]\)-index of a graph (Q2811195) (← links)
- \(B\)-coloring of \(m\)-tight graphs (Q2840540) (← links)
- (Q3766875) (← links)
- B-chromatic number: Beyond NP-hardness (Q5363791) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)