Hadwiger number
= Hadwiger number
{wiki=Hadwiger_number}
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 \\).