A partial k-arboretum of graphs with bounded treewidth
type: Item
instance of: scholarly article
title: A partial k-arboretum of graphs with bounded treewidth
zbMATH Open document ID: 0912.68148
DOI: 10.1016/S0304-3975(97)00228-4
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1238685
zbMATH Keywords: treewidth
zbMATH Keywords: partial \(k\)-tree
zbMATH Keywords: graph classes
author: Hans L. Bodlaender
MaRDI profile type: Publication
Wikidata QID: Q29542840
cites work: A lower bound on the area of permutation layouts
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: An algebraic theory of graph reduction
cites work: Characterization and Recognition of Partial 3-Trees
cites work: Forbidden minors characterization of partial 3-trees
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Graph expressions and graph rewritings
cites work: Linear-time computation of optimal subgraphs of decomposable graphs
cites work: Q4035355
cites work: On the Complexity of Covering Vertices by Faces in a Planar Graph
cites work: On the complexity of embedding planar graphs to minimize certain distance measures
cites work: Quickly excluding a forest
cites work: Q4734761
cites work: Q3795218
cites work: Complexity of path-forming games
cites work: On Linear Time Minor Tests with Depth-First Search
cites work: Q4291429
cites work: ON DISJOINT CYCLES
cites work: Domino Treewidth
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: The Pathwidth and Treewidth of Cographs
cites work: Q4304362
cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
cites work: A simple linear-time algorithm for finding path-decompositions of small width
cites work: On the Cutwidth and the Topological Bandwidth of a Tree
cites work: Q4385531
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Fugitive-search games on graphs and related parameters
cites work: Q4037291
cites work: The vertex separation and search number of a graph
cites work: Nonconstructive advances in polynomial-time complexity
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A separator theorem for graphs of bounded genus
cites work: A Separator Theorem for Chordal Graphs
cites work: Q3328583
cites work: Hyperedge replacement: grammars and languages
cites work: Q3785988
cites work: On Time Versus Space
cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
cites work: The vertex separation number of a graph equals its path-width
cites work: Obstruction set isolation for the gate matrix layout problem
cites work: Interval graphs and searching
cites work: Searching and pebbling
cites work: Treewidth. Computations and approximations
cites work: The nonexistence of reduction rules giving an embedding into a \(k\)-tree
cites work: Recontamination does not help to search a graph
cites work: Q3789084
cites work: A Separator Theorem for Planar Graphs
cites work: The Role of Elimination Trees in Sparse Factorization
cites work: Topological Bandwidth
cites work: Q3477966
cites work: Triangulating graphs without asteroidal triples
cites work: Graph minors. XX: Wagner's conjecture
cites work: Graph minors. I. Excluding a forest
cites work: Q3222217
cites work: Graph minors. III. Planar tree-width
cites work: Q3680875
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Graph minors. V. Excluding a planar graph
cites work: Graph minors. VI. Disjoint paths across a disc
cites work: Graph minors. VII: Disjoint paths on a surface

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. IV: Tree-width and well-quasi-ordering

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. IX: Disjoint crossed paths

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. VIII: A Kuratowski theorem for general surfaces

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. XV: Giant steps

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. XVI: Excluding a non-planar graph

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. XVII: Taming a vortex

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. XXII. Irrelevant vertices in linkage problems

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Q4273877

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. XI: Circuits on a surface

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. XII: Distance on a surface

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Graph minors. XIII: The disjoint paths problem

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Quickly excluding a planar graph

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Q4273838

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: On simple characterizations of k-trees

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Q4734768

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Q3692864

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Characterizations of outerplanar graphs

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Mixed searching and proper-path-width

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Q4373690

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Q4385515

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: On hyperedge replacement and BNLC graph grammars

A partial k-arboretum of graphs with bounded treewidth (cites work)
cites work: Q3822197

A partial k-arboretum of graphs with bounded treewidth (full work available at URL)
full work available at URL: s0304-3975(97)00228-4

A partial k-arboretum of graphs with bounded treewidth (OpenAlex ID)
OpenAlex ID: W2087083200

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: Q4734761
Similarity Score: 0.90504545
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: Q3361907
Similarity Score: 0.8993042
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: A lower bound for the vertex boundary-width of complete \(k\)-ary trees
Similarity Score: 0.89787114
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: Partitioning graphs of bounded tree-width
Similarity Score: 0.89320636
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: Q4894618
Similarity Score: 0.892624
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: Q3090478
Similarity Score: 0.89150846
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: Q6134965
Similarity Score: 0.8914985
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: A managed Bayesian risk approach for decision making alternatives
Similarity Score: 0.88710684
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: Treewidth of the generalized Kneser graphs
Similarity Score: 0.8858177
Recommender Run: Recommender Run 3

A partial k-arboretum of graphs with bounded treewidth (Recommended article)
Recommended article: A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
Similarity Score: 0.8796947
Recommender Run: Recommender Run 3