The following pages link to Explicit bounds for graph minors (Q723881):
Displaying 11 items.
- Explicit bounds for graph minors (Q723881) (← links)
- Shortest path embeddings of graphs on surfaces (Q1688859) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- A sharp bound for the growth of minimal graphs (Q2129495) (← links)
- A lower bound on the tree-width of graphs with irrelevant vertices (Q2312606) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- (Q4013453) (← links)
- Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds (Q4598273) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Low-dimensional topology. Abstracts from the workshop held January 15--21, 2023 (Q6076074) (← links)
- Short topological decompositions of non-orientable surfaces (Q6624179) (← links)
