Results on the Grundy Chromatic Number of Graphs¶

Zaker, M. (2006). Results on the Grundy Chromatic Number of Graphs. Discrete Mathematics, 306(23), 3166-3173.

Type: Journal article
Intellectual base: Primary research
Year: 2006
DOI: 10.1016/j.disc.2005.06.044
Link: https://doi.org/10.1016/j.disc.2005.06.044

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Grundy Number
- Christen and Selkow introduced this graph-coloring invariant and its defining lower-color-neighbor condition. Zaker develops the same definition, complexity, bounds, and well-colored-graph consequences.

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