Chromatic number
The chromatic number of a finite simple graph is the minimum number of colors in a proper vertex coloring; equality needs both upper and lower certificates.
atlas-chromatic-number · canonical_mko
Chromatic number
This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.
Catalogue presentation and source-binding data