Hajós's graph-colouring conjecture

Catlin, P. A. (1979). Hajós's graph-colouring conjecture: variations and counterexamples.

Type

Unclassified

Intellectual base

Unclassified

Year

1979

DOI

10.1016/0095-8956(79)90062-5

Link

https://doi.org/10.1016/0095-8956(79)90062-5

Cited by

1 citation across 1 artifact.

Domain-specific

• Hajós construction
  • Endpoint choice matters for nonsymmetric inputs, simple-graph conventions can require cleanup and the broader Hajós constructibility theorem also permits vertex identification and supergraphs.

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