Highly connected sets and the excluded grid theorem
From MaRDI portal
Publication:1306423
DOI10.1006/jctb.1998.1862zbMath0949.05075OpenAlexW2165303918MaRDI QIDQ1306423
Konstantin Yu. Gorbunov, Reinhard Diestel, Tommy R. Jensen, Carsten Thomassen
Publication date: 29 November 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1862
Related Items
Edge-disjoint odd cycles in 4-edge-connected graphs, Embedding grids in surfaces, Contraction bidimensionality of geometric intersection graphs, Forcing a Kr minor by high external connectivity, Towards the Graph Minor Theorems for Directed Graphs, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Fixed-Parameter Tractability of Treewidth and Pathwidth, Graph Minors and Parameterized Algorithm Design, Coloring immersion-free graphs, Minors in graphs of large \(\theta_r\)-girth, Characterising \(k\)-connected sets in infinite graphs, Sparse obstructions for minor-covering parameters, Some recent progress and applications in graph minor theory, Fast balanced partitioning is hard even on grids and trees, Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs, On the excluded minor structure theorem for graphs of large tree-width, Connectivity and tree structure in finite graphs, Characterising graphs with no subdivision of a wheel of bounded diameter, Grid minors in damaged grids, \(K_{6}\) minors in 6-connected graphs of bounded tree-width, An Improved Algorithm for Finding Cycles Through Elements, The disjoint paths problem in quadratic time, Low Polynomial Exclusion of Planar Graph Patterns, Branch-width and Rota's conjecture, Linkless and flat embeddings in 3-space, Packing cycles through prescribed vertices under modularity constraints, Parameters Tied to Treewidth, Minor-Closed Graph Classes with Bounded Layered Pathwidth, On the Block Number of Graphs, Treewidth lower bounds with brambles, Polynomial treewidth forces a large grid-like-minor, Linearity of grid minors in treewidth with applications through bidimensionality, The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs, \(K_{6}\) minors in large 6-connected graphs, The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs, Treewidth computations. I: Upper bounds, Tree-width of graphs without a \(3\times 3\) grid minor, Half-integral packing of odd cycles through prescribed vertices, Graph minor hierarchies, Tree-width and planar minors, What is on his mind?, The monadic second-order logic of graphs. XV: On a conjecture by D. Seese, Half-integral linkages in highly connected directed graphs, Contraction obstructions for treewidth, Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, Counting Answers to Existential Questions, Linear connectivity forces large complete bipartite minors, Planar k-Path in Subexponential Time and Polynomial Space, Contraction-Bidimensionality of Geometric Intersection Graphs, Branch-width and well-quasi-ordering in matroids and graphs., Unnamed Item
Cites Work
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- On a complexity of the formula \((A\bigvee B) \Rightarrow C\)
- Quickly excluding a planar graph
- A simpler proof of the excluded minor theorem for higher surfaces
- Graph minors. IV: Tree-width and well-quasi-ordering
- Unnamed Item
- Unnamed Item
- Unnamed Item
