Nordhaus-Gaddum for treewidth
From MaRDI portal
Publication:412239
DOI10.1016/j.ejc.2011.10.005zbMath1239.05151arXiv1109.1602MaRDI QIDQ412239
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
05C05: Trees
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12: Distance in graphs
Related Items
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