scientific article; zbMATH DE number 1057879
From MaRDI portal
Publication:4352948
zbMATH Open0895.05034MaRDI QIDQ4352948FDOQ4352948
Authors: Bruce Reed 
Publication date: 14 September 1998
Title of this publication is not available (Why is that?)
Recommendations
- On the connectivity index of trees
- Trees of extremal connectivity index
- Connected tree-width
- Bounding connected tree-width
- On connectivities of tree graphs
- Tree-Related Widths of Graphs and Hypergraphs
- Tree-width and circumference of graphs
- New characterisations of tree-based networks and proximity measures
- scientific article; zbMATH DE number 772777
- Treewidth: Characterizations, Applications, and Computations
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (88)
- Canonical tree-decompositions of finite graphs. II. Essential parts
- Sparse graphs of high gonality
- Maximum induced forests in graphs of bounded treewidth
- Layered separators in minor-closed graph classes with applications
- Connectivity and tree structure in finite graphs
- Pathwidth of outerplanar graphs
- Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs
- Grid minors in damaged grids
- Nordhaus-Gaddum for treewidth
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Submodular partition functions
- Treewidth computations. II. Lower bounds
- The disjoint paths problem in quadratic time
- Linkless and flat embeddings in 3-space
- Bounding connected tree-width
- The degree-diameter problem for sparse graph classes
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Orthogonal tree decompositions of graphs
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- Recent developments on graphs of bounded clique-width
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Linear connectivity forces large complete bipartite minors
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- Treewidth lower bounds with brambles
- Polynomial treewidth forces a large grid-like-minor
- Connected tree-width
- Fork-decompositions of matroids
- Highly connected sets and the excluded grid theorem
- \(K_{6}\) minors in large 6-connected graphs
- Directed tree-width
- Edge-disjoint odd cycles in graphs with small chromatic numbers
- Packing cycles through prescribed vertices under modularity constraints
- Boolean-width of graphs
- Computing the branchwidth of interval graphs
- Branch decompositions and minor containment
- Lower bounds for treewidth of product graphs
- Some recent progress and applications in graph minor theory
- Brambles, prisms and grids
- Coloring immersion-free graphs
- An Improved Algorithm for Finding Cycles Through Elements
- Treewidth computations. I: Upper bounds
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
- Approximating clique-width and branch-width
- Brambles and independent packings in chordal graphs
- On tree width, bramble size, and expansion
- The relative clique-width of a graph
- An improvement of Reed's treewidth approximation
- Hypertree width and related hypergraph invariants
- Structure of graphs with locally restricted crossings
- On matroids of branch-width three.
- Chordal bipartite graphs of bounded tree- and clique-width
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
- Tree-width and the Sherali-Adams operator
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- Finding disjoint paths in split graphs
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width
- Notes on graph product structure theory
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- Packing and covering induced subdivisions
- Half-integral packing of odd cycles through prescribed vertices
- Channel assignment on graphs of bounded treewidth
- Better bounds for poset dimension and boxicity
- Recent techniques and results on the Erdős-Pósa property
- List-coloring graphs without subdivisions and without immersions
- Guarded fixed point logics and the monadic theory of countable trees.
- Tangle and Maximal Ideal
- Tree-width dichotomy
- Tangle-tree duality in abstract separation systems
- Tree independence number. I. (Even hole, diamond, pyramid)-free graphs
- The product structure of squaregraphs
- Clustered 3-colouring graphs of bounded degree
- Constant Congestion Brambles
- Computing with tangles
- Erdös-Pósa Property of Obstructions to Interval Graphs
- Tree densities in sparse graph classes
- Tangle bases: Revisited
- Clustered coloring of graphs with bounded layered treewidth and bounded degree
- Planar \(k\)-path in subexponential time and polynomial space
- The splitting power of branching programs of bounded repetition and CNFs of bounded width
- On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs
- Towards the graph minor theorems for directed graphs
- Induced disjoint paths in circular-arc graphs in linear time
- On strict brambles
- Erdős–Pósa property of obstructions to interval graphs
- Digraphs of bounded width
- Tangle and ultrafilter: game theoretical interpretation
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352948)
