The smallest hard-to-color graph¶

Pierre Hansen, J. K. (1991). The smallest hard-to-color graph.

Type: Unclassified
Intellectual base: Unclassified
Year: 1991
DOI: 10.1016/0012-365x(91)90313-q
Link: https://doi.org/10.1016/0012-365x(91)90313-q

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Well-colored graph
- The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

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