Graph minors. IV: Tree-width and well-quasi-ordering
From MaRDI portal
Publication:2639869
DOI10.1016/0095-8956(90)90120-OzbMath0719.05032OpenAlexW2036740975MaRDI QIDQ2639869
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(90)90120-o
Related Items (68)
The monadic second order logic of graphs. VI: On several representations of graphs by relational structures ⋮ Embedding grids in surfaces ⋮ Algorithm for finding structures and obstructions of tree ideals ⋮ A polynomial time algorithm for strong edge coloring of partial \(k\)-trees ⋮ On search, decision, and the efficiency of polynomial-time algorithms ⋮ Parameterized dominating set problem in chordal graphs: Complexity and lower bound ⋮ Evaluating interval-valued influence diagrams ⋮ More problems in rewriting ⋮ A Menger-like property of tree-width: The finite case ⋮ Grids and their minors ⋮ Fixed-Parameter Tractability, A Prehistory, ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Graph minors. VIII: A Kuratowski theorem for general surfaces ⋮ On well-quasi-ordering-finite graphs by immersion ⋮ A simpler proof of the excluded minor theorem for higher surfaces ⋮ On spectra of sentences of monadic second order logic with counting ⋮ Vertex-minors, monadic second-order logic, and a conjecture by Seese ⋮ How to contract an essentially 6-connected graph to a 5-connected graph ⋮ Rank-width: algorithmic and structural results ⋮ The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues ⋮ Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ Some recent progress and applications in graph minor theory ⋮ All longest cycles in a 2‐connected partial 3‐tree share a common vertex ⋮ The complexity of learning minor closed graph classes ⋮ Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture ⋮ Branch-width and Rota's conjecture ⋮ Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices ⋮ A lower bound for treewidth and its consequences ⋮ Rankings of graphs ⋮ Treewidth is a lower bound on graph gonality ⋮ Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Graph minors. XVIII: Tree-decompositions and well-quasi-ordering ⋮ The theory of guaranteed search on graphs ⋮ Well-quasi-ordering of matrices under Schur complement and applications to directed graphs ⋮ Parameters Tied to Treewidth ⋮ Improving spanning trees by upgrading nodes ⋮ Graph minors. XIX: Well-quasi-ordering on a surface. ⋮ Upper Bounds on the Graph Minor Theorem ⋮ Graph minors. X: Obstructions to tree-decomposition ⋮ Well-quasi-ordering versus clique-width ⋮ A unified treatment of linked and lean tree-decompositions ⋮ A Menger-like property of tree-cut width ⋮ Finite structure for Friedman ideals of finite trees ⋮ Graph minors. XX: Wagner's conjecture ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Well-quasi-ordering versus clique-width: new results on bigenic classes ⋮ Two applications of analytic functors ⋮ Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams ⋮ Minor-Minimal Planar Graphs of Even Branch-Width ⋮ Graph minor theory ⋮ Tree-width, path-width, and cutwidth ⋮ Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes ⋮ A partial k-arboretum of graphs with bounded treewidth ⋮ Nested cycles in large triangulations and crossing-critical graphs ⋮ Multiplicities of eigenvalues and tree-width of graphs ⋮ Rank-width and vertex-minors ⋮ Bicriteria Network Design Problems ⋮ A Logical Approach to Constraint Satisfaction ⋮ Graph minors. I. Excluding a forest ⋮ Surfaces, tree-width, clique-minors, and partitions ⋮ Branch-width and well-quasi-ordering in matroids and graphs. ⋮ Highly connected sets and the excluded grid theorem ⋮ Graphs without \(K_ 4\) and well-quasi-ordering ⋮ Graph minors. III. Planar tree-width ⋮ Disjoint Paths—A Survey ⋮ Rank-width and Well-quasi-ordering of Skew-symmetric Matrices ⋮ Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
Cites Work
- Unnamed Item
- Unnamed Item
- Graph minors. III. Planar tree-width
- Graph minors. V. Excluding a planar graph
- A Menger-like property of tree-width: The finite case
- 103 graphs that are irreducible for the projective plane
- Wohlquasigeordnete Klassen endlicher Graphen
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Graph minors. II. Algorithmic aspects of tree-width
- A kuratowski theorem for the projective plane
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Graph minors. IV: Tree-width and well-quasi-ordering
