Pages that link to "Item:Q1022348"
From MaRDI portal
The following pages link to Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348):
Displaying 13 items.
- Grid minors in damaged grids (Q405308) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Neighborhood contraction in graphs (Q1616737) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- (Q5743499) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
