Nordhaus-Gaddum for treewidth

DOI10.1016/j.ejc.2011.10.005zbMath1239.05151arXiv1109.1602OpenAlexW2039737021MaRDI QIDQ412239

Gwenaël Joret, David R. Wood

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.1602

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (2)

Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph ⋮ Nordhaus-Gaddum bounds for locating domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hadwiger's number---A problem of the Nordhaus-Gaddum type
• A partial k-arboretum of graphs with bounded treewidth
• Graph searching and a min-max theorem for tree-width
• Clique minors in graphs and their complements
• On the Hajós number of graphs
• Rank-width of random graphs
• On Complementary Graphs
• Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts

This page was built for publication: Nordhaus-Gaddum for treewidth