Hadwiger number

Graphs with small Hadwiger number

A graph G has Hadwiger number at most two if and only if it is a forest, for a three-vertex complete minor can only be formed by contracting a cycle in G.

A graph has Hadwiger number at most three if and only if its treewidth is at most two, which is true if and only if each of its biconnected components is a series–parallel graph.

Wagner's theorem, which characterizes the planar graphs by their forbidden minors, implies that the planar graphs have Hadwiger number at most four. In the same paper that proved this theorem, also characterized the graphs with Hadwiger number at most four more precisely: they are graphs that can be formed by clique-sum operations that combine planar graphs with the eight-vertex Wagner graph.

The graphs with Hadwiger number at most five include the apex graphs and the linklessly embeddable graphs, both of which have the complete graph K among their forbidden minors.

Sparsity

Every graph with n vertices and Hadwiger number k has edges. This bound is tight: for every k, there exist graphs with Hadwiger number k that have edges. If a graph G has Hadwiger number k, then all of its subgraphs also have Hadwiger number at most k, and it follows that G must have degeneracy . Therefore, the graphs with bounded Hadwiger number are sparse graphs.

Coloring

The Hadwiger conjecture states that the Hadwiger number is always at least as large as the chromatic number of G. That is, every graph with Hadwiger number k should have a graph coloring with at most k colors. The case is equivalent (by Wagner's characterization of the graphs with this Hadwiger number) to the four color theorem on colorings of planar graphs, and the conjecture has also been proven for k ≤ 5, but remains unproven for larger values of k.

Because of their low degeneracy, the graphs with Hadwiger number at most k can be colored by a greedy coloring algorithm using colors.

Computational complexity

Testing whether the Hadwiger number of a given graph is at least a given value k is NP-complete, from which it follows that determining the Hadwiger number is NP-hard. However, the problem is fixed-parameter tractable: there is an algorithm for finding the largest clique minor in an amount of time that depends only polynomially on the size of the graph, but exponentially in h(G). Additionally, polynomial time algorithms can approximate the Hadwiger number to within an approximation ratio of O(\sqrt n), significantly more accurately than the best polynomial-time approximation (assuming P ≠ NP) to the size of the largest complete subgraph.

Related concepts

The achromatic number of a graph G is the size of the largest clique that can be formed by contracting a family of independent sets in G.

Uncountable clique minors in infinite graphs may be characterized in terms of havens, which formalize the evasion strategies for certain pursuit–evasion games: if the Hadwiger number is uncountable, then it equals the largest order of a haven in the graph.

Every graph with Hadwiger number k has at most n2 cliques (complete subgraphs).

defines a class of graph parameters that he calls S-functions, which include the Hadwiger number. These functions from graphs to integers are required to be zero on graphs with no edges, to be minor-monotone, to increase by one when a new vertex is added that is adjacent to all previous vertices, and to take the larger value from the two subgraphs on either side of a clique separator. The set of all such functions forms a complete lattice under the operations of elementwise minimization and maximization. The bottom element in this lattice is the Hadwiger number, and the top element is the treewidth.

Footnotes

Notes

References

• .
• .
• {{citation
• {{citation
• .
• {{citation
• .
• {{citation
• .
• {{citation
• {{citation
• .

References

1. {{harvtxt. Kostochka. 1984; {{harvtxt. Thomason. 2001. The letters O and Ω in these expressions invoke [[big O notation]].
2. {{harvtxt. Alon. Lingas. Wahlen. 2007