BabelNet

bn:16035802n

Noun Concept

No term available

Kromatski broj grafa γ {\displaystyle \gamma } je najmanji prirodan broj k {\displaystyle k} sa svojstvom da je G {\displaystyle G} k {\displaystyle k} -obojiv. Wikipedia

Relations

Sources

IS A

invariant de graphe

problème algorithmique

entier relatif

grandeur sans dimension

PART OF

polynôme chromatique

21 problèmes NP-complets de Karp

FACET OF

coloration de graphe

STUDIED BY

théorie des graphes