The following pages link to (Q4352948):
Displaying 50 items.
- Canonical tree-decompositions of finite graphs. II. Essential parts (Q257005) (← links)
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Connectivity and tree structure in finite graphs (Q397061) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Nordhaus-Gaddum for treewidth (Q412239) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Submodular partition functions (Q1045090) (← links)
- Edge-disjoint odd cycles in graphs with small chromatic numbers (Q1296141) (← links)
- Highly connected sets and the excluded grid theorem (Q1306423) (← links)
- Channel assignment on graphs of bounded treewidth (Q1417576) (← links)
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Directed tree-width (Q1850539) (← links)
- On matroids of branch-width three. (Q1850629) (← links)
- Guarded fixed point logics and the monadic theory of countable trees. (Q1853504) (← links)
- Fork-decompositions of matroids (Q1883405) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Tree-width dichotomy (Q2136198) (← links)
- Tangle-tree duality in abstract separation systems (Q2217534) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Tangle and ultrafilter: game theoretical interpretation (Q2308502) (← links)
- Tree-width and the Sherali-Adams operator (Q2386210) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width (Q2421546) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
