Pages that link to "Item:Q496694"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694):
Displaying 4 items.
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
