Pages that link to "Item:Q2221926"
From MaRDI portal
The following pages link to Towards tight(er) bounds for the excluded grid theorem (Q2221926):
Displaying 16 items.
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Tight space bounds for \(\ell\)-exclusion (Q2251155) (← links)
- Grid induced minor theorem for graphs of small degree (Q2692786) (← links)
- Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid (Q2904769) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Constant Congestion Brambles in Directed Graphs (Q5071097) (← links)
- Dimension Bound for Badly Approximable Grids (Q5206102) (← links)
- Characterising graphs with no subdivision of a wheel of bounded diameter (Q6038576) (← links)
- Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree (Q6144405) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- Bounded-diameter tree-decompositions (Q6548028) (← links)
- Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
