Pages that link to "Item:Q4971668"
From MaRDI portal
The following pages link to Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668):
Displaying 14 items.
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- A fast algorithm for equitable coloring (Q532129) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- Improving lower bounds for equitable chromatic number (Q2147053) (← links)
- Bounded colouring motivated by the limited resource partially concurrent open shop problem (Q2241155) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610) (← links)
- On equitable chromatic number of Tadpole graph T_{m,n} (Q5085729) (← links)
- (Q5241117) (← links)
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem (Q5301444) (← links)
- Equitable oriented coloring (Q6047973) (← links)
- New results on the robust coloring problem (Q6127005) (← links)
- Equitable colorings of \(l\)-corona products of cubic graphs (Q6577196) (← links)
