The following pages link to (Q4792909):
Displaying 24 items.
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Connected tree-width (Q722321) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- A unified treatment of linked and lean tree-decompositions (Q1745735) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Characterising \(k\)-connected sets in infinite graphs (Q2171028) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- On strict brambles (Q2689118) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Tangle and Maximal Ideal (Q2980900) (← links)
- Constructing Brambles (Q3182927) (← links)
- On the Block Number of Graphs (Q4623134) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors (Q5194622) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- A parameterized approximation scheme for min \(k\)-cut (Q6654555) (← links)
