Assertion: graph's g | /r/HasAspect | proper coloring
Facets:
value: with k − 1 colors
type: OTHER
Source sentences:
text: The Hadwiger conjecture in graph theory proposes that if a graph G does not contain a minor isomorphic to the complete graph on k vertices, then G has a proper coloring with k − 1 colors.