Achievable sets, brambles, and sparse treewidth obstructions
type: Item
instance of: scholarly article
title: Achievable sets, brambles, and sparse treewidth obstructions
zbMATH Open document ID: 1116.05076
author: Brian Lucena
published in: Discrete Applied Mathematics
publication date: 2007-05-30T00:00:00Z
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 5159567
zbMATH Keywords: obstruction
zbMATH Keywords: graph minor
zbMATH Keywords: minimal forbidden minor
MaRDI profile type: Publication
full work available at URL: j.dam.2006.11.006
OpenAlex ID: W2023843482
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Algorithms – ESA 2005
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Algorithms – ESA 2004
cites work: The structure of obstructions to treewidth and pathwidth
cites work: Q4426346
cites work: Heuristic and metaheuristic methods for computing graph treewidth
cites work: Multiplicities of eigenvalues and tree-width of graphs
cites work: Q4947393
cites work: A New Lower Bound for Tree-Width Using Maximum Cardinality Search
cites work: The Structure and Number of Obstructions to Treewidth
cites work: Q3684139
cites work: Graph minors. II. Algorithmic aspects of tree-width
DOI: 10.1016/J.DAM.2006.11.006
description: scientific article; zbMATH DE number 5159567