Pages that link to "Item:Q747619"

The following pages link to \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619):

Displaying 13 items.

• On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
• On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
• \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
• Edge-\(b\)-coloring trees (Q1702122) (← links)
• \(b\)-coloring of tight graphs (Q1759847) (← links)
• Cooperative colorings of trees and of bipartite graphs (Q2294110) (← links)
• The \(b\)-chromatic index of graphs (Q2352073) (← links)
• A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs (Q2689124) (← links)
• A note on the bichromatic numbers of graphs (Q3061187) (← links)
• (Q3195320) (redirect page) (← links)
• B-chromatic number: Beyond NP-hardness (Q5363791) (← links)
• \(b\)-coloring parameterized by clique-width (Q6614620) (← links)