scientific article; zbMATH DE number 1057879

Publication date: 14 September 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

tree decomposition tree width bramble number connectivity invariant

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (83)

Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ Clustered 3-colouring graphs of bounded degree ⋮ On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs ⋮ Fork-decompositions of matroids ⋮ Pathwidth of outerplanar graphs ⋮ Tree densities in sparse graph classes ⋮ Tree-width dichotomy ⋮ An Improvement of Reed’s Treewidth Approximation ⋮ Towards the Graph Minor Theorems for Directed Graphs ⋮ Induced disjoint paths in circular-arc graphs in linear time ⋮ Coloring immersion-free graphs ⋮ Tree-width and the Sherali-Adams operator ⋮ The relative clique-width of a graph ⋮ Sparse Graphs of High Gonality ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Layered separators in minor-closed graph classes with applications ⋮ Some recent progress and applications in graph minor theory ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Structure of Graphs with Locally Restricted Crossings ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ Connectivity and tree structure in finite graphs ⋮ Grid minors in damaged grids ⋮ \(K_{6}\) minors in 6-connected graphs of bounded tree-width ⋮ An Improved Algorithm for Finding Cycles Through Elements ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ The disjoint paths problem in quadratic time ⋮ Nordhaus-Gaddum for treewidth ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ The product structure of squaregraphs ⋮ Linkless and flat embeddings in 3-space ⋮ On strict brambles ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Packing cycles through prescribed vertices under modularity constraints ⋮ Channel assignment on graphs of bounded treewidth ⋮ Tangle and Maximal Ideal ⋮ Tangle-tree duality in abstract separation systems ⋮ Treewidth lower bounds with brambles ⋮ Polynomial treewidth forces a large grid-like-minor ⋮ Orthogonal Tree Decompositions of Graphs ⋮ The degree-diameter problem for sparse graph classes ⋮ Hypertree width and related hypergraph invariants ⋮ Finding disjoint paths in split graphs ⋮ The splitting power of branching programs of bounded repetition and CNFs of bounded width ⋮ The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs ⋮ \(K_{6}\) minors in large 6-connected graphs ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs ⋮ Treewidth computations. I: Upper bounds ⋮ Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm ⋮ Recent developments on graphs of bounded clique-width ⋮ Half-integral packing of odd cycles through prescribed vertices ⋮ Computing the branchwidth of interval graphs ⋮ Treewidth computations. II. Lower bounds ⋮ Approximating clique-width and branch-width ⋮ Boolean-width of graphs ⋮ Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor ⋮ Computing with Tangles ⋮ Tree independence number. I. (Even hole, diamond, pyramid)-free graphs ⋮ Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width ⋮ Clustered coloring of graphs with bounded layered treewidth and bounded degree ⋮ On tree width, bramble size, and expansion ⋮ Lower bounds for treewidth of product graphs ⋮ Branch decompositions and minor containment ⋮ Better bounds for poset dimension and boxicity ⋮ Notes on graph product structure theory ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction ⋮ Tangle and ultrafilter: game theoretical interpretation ⋮ Linear connectivity forces large complete bipartite minors ⋮ Packing and Covering Induced Subdivisions ⋮ Planar k-Path in Subexponential Time and Polynomial Space ⋮ Chordal bipartite graphs of bounded tree- and clique-width ⋮ Brambles and independent packings in chordal graphs ⋮ Submodular partition functions ⋮ Edge-disjoint odd cycles in graphs with small chromatic numbers ⋮ Digraphs of Bounded Width ⋮ Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs ⋮ Directed tree-width ⋮ On matroids of branch-width three. ⋮ Highly connected sets and the excluded grid theorem ⋮ Guarded fixed point logics and the monadic theory of countable trees. ⋮ Unnamed Item ⋮ Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs ⋮ Canonical tree-decompositions of finite graphs. II. Essential parts

This page was built for publication: