Achievable sets, brambles, and sparse treewidth obstructions

DOI10.1016/j.dam.2006.11.006zbMath1116.05076OpenAlexW2023843482MaRDI QIDQ881587

Brian Lucena

Publication date: 30 May 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.11.006

zbMATH Keywords

obstructiongraph minorminimal forbidden minor

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items

Bounding the search number of graph products ⋮ Systematic and deterministic graph minor embedding for Cartesian products of graphs ⋮ Treewidth and gonality of glued grid graphs ⋮ On the treewidth of toroidal grids ⋮ Parameters Tied to Treewidth ⋮ On the gonality of Cartesian products of graphs ⋮ A branch-and-price-and-cut method for computing an optimal bramble ⋮ The treewidth of line graphs ⋮ Lower bounds for treewidth of product graphs ⋮ On sparsification for computing treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A partial k-arboretum of graphs with bounded treewidth
• Multiplicities of eigenvalues and tree-width of graphs
• The structure of obstructions to treewidth and pathwidth
• The Structure and Number of Obstructions to Treewidth
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity of Finding Embeddings in a k-Tree
• A New Lower Bound for Tree-Width Using Maximum Cardinality Search
• Algorithms – ESA 2004
• Algorithms – ESA 2005
• Heuristic and metaheuristic methods for computing graph treewidth
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Achievable sets, brambles, and sparse treewidth obstructions