The following pages link to (Q4284253):
Displaying 4 items.
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Approximation results for the optimum cost chromatic partition problem (Q4572001) (← links)
