Some Perfect Coloring Properties of Graphs

Christen, C. A., & Selkow, S. M. (1979). Some Perfect Coloring Properties of Graphs. Journal of Combinatorial Theory, Series B, 27(1), 49-59.

Type

Journal article

Intellectual base

Primary research

Year

1979

DOI

10.1016/0095-8956(79)90067-4

Link

https://doi.org/10.1016/0095-8956(79)90067-4

Cited by

3 citations across 3 artifacts.

Domain-specific

• Greedy coloring
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
• Grundy Number
  • Christen and Selkow introduced this graph-coloring invariant and its defining lower-color-neighbor condition.
• Well-colored graph
  • The property quantifies over all vertex orders, not one successful greedy run, applies to the declared simple undirected graph convention and is equivalently equality of chromatic and Grundy numbers.

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