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 3 items.

• A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs (Q2689124) (← links)
• (Q3195320) (redirect page) (← links)
• \(b\)-coloring parameterized by clique-width (Q6614620) (← links)