New methods to color the vertices of a graph¶

Brélaz, D. (1979). New methods to color the vertices of a graph. ACM.

Type: Unclassified
Intellectual base: Unclassified
Year: 1979
DOI: 10.1145/359094.359101
Link: https://doi.org/10.1145/359094.359101

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Greedy coloring
- Greedy coloring runs in linear or near-linear time for a fixed vertex order, always produces a proper coloring, and can use far more than the chromatic number when the order is poor.

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:023189bf61e6 · see in the full table