Pages that link to "Item:Q5259539"
From MaRDI portal
The following pages link to Polynomial bounds for the grid-minor theorem (Q5259539):
Displaying 29 items.
- An edge variant of the Erdős-Pósa property (Q284717) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- On first-order definitions of subgraph isomorphism properties (Q679970) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Obstructions to a small hyperbolicity in Helly graphs (Q1625787) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
- The grid theorem for vertex-minors (Q2099410) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- Polynomials vanishing on grids: the Elekes-Rónyai problem revisited (Q2816472) (← links)
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- On the Block Number of Graphs (Q4623134) (← links)
- (Q4638077) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
