The following pages link to (Q2904769):
Displaying 14 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- A new proof of the flat wall theorem (Q684127) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← 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)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Tree-width and planar minors (Q2259855) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
