The following pages link to (Q5377224):
Displaying 12 items.
- A fast algorithm for equitable coloring (Q532129) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774) (← links)
- Tree-coloring problems of bounded treewidth graphs (Q2292136) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- (Q5874480) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Gap one bounds for the equitable chromatic number of block graphs (Q6558671) (← links)
- Approximation algorithms for job scheduling with block-type conflict graphs (Q6568400) (← links)
