Nordhaus-Gaddum for treewidth

Authors:
Gwenaël Joret;David R. Wood
Affiliations:
Département d'Informatique, Université Libre de Bruxelles, Brussels, Belgium;Department of Mathematics and Statistics, The University of Melbourne, Melbourne, Australia
Venue:
European Journal of Combinatorics
Year:
2012

On Hadwiger's number: a problem of the Nordhaus-Gaddum type

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
On the Hajós number of graphs

Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Clique minors in graphs and their complements

Journal of Combinatorial Theory Series B
Nordhaus–Gaddum-type Theorems for decompositions into many parts

Journal of Graph Theory
Rank-width of random graphs

Journal of Graph Theory

Hi-index	0.00

We prove that, for every n-vertex graph G, the treewidth of G plus the treewidth of the complement of G is at least n-2. This bound is tight.