A fast algorithm for equitable coloring

Henry A Kierstead, A. V. K., Mydlarz, M., & Szemerédi, E. (2010). A fast algorithm for equitable coloring.

Type

Unclassified

Intellectual base

Unclassified

Year

2010

DOI

10.1007/s00493-010-2483-5

Link

https://doi.org/10.1007/s00493-010-2483-5

Cited by

1 citation across 1 artifact.

Domain-specific

• Equitable coloring
  • An equitable k-coloring partitions a graph's vertices into k independent sets of nearly equal cardinality; the equitable chromatic number is the least feasible k under the chosen convention.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:097b17afa2f0 · see in the full table