Pages that link to "Item:Q1306423"
From MaRDI portal
The following pages link to Highly connected sets and the excluded grid theorem (Q1306423):
Displayed 25 items.
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- What is on his mind? (Q709300) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Tree-width of graphs without a \(3\times 3\) grid minor (Q967302) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Branch-width and Rota's conjecture (Q1403924) (← links)
- Graph minor hierarchies (Q1764803) (← links)
- Branch-width and well-quasi-ordering in matroids and graphs. (Q1850591) (← links)
- Embedding grids in surfaces (Q1883290) (← links)
- On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- Forcing a <i>K<sub>r</sub></i> minor by high external connectivity (Q4537560) (← links)