The Hadwiger number, denoted as \( H(G) \) for a graph \( G \), is a numerical graph invariant that represents the maximum number \( k \) such that the graph \( G \) can be colored with \( k \) colors without forming any monochromatic complete graph \( K_t \) for every \( t \leq k \).

Ancestors (5)

  1. Graph invariants
  2. Graph theory
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version