Pages that link to "Item:Q1306423"
From MaRDI portal
The following pages link to Highly connected sets and the excluded grid theorem (Q1306423):
Displaying 50 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← 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)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
- What is on his mind? (Q709300) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← 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)
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← 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)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Characterising \(k\)-connected sets in infinite graphs (Q2171028) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Tree-width and planar minors (Q2259855) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width (Q2421546) (← 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)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← 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)
- On the Block Number of Graphs (Q4623134) (← links)
- Counting Answers to Existential Questions (Q5091275) (← links)
- Half-integral linkages in highly connected directed graphs (Q5111723) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
