Recommendations
Cites work
Cited in
(22)- Linear connectivity forces large complete bipartite minors
- Graph minors. XXI. graphs with unique linkages
- A partial k-arboretum of graphs with bounded treewidth
- Graph minors. XIX: Well-quasi-ordering on a surface.
- On the immersion relation and an embedding problem for infinite graphs
- On the excluded minor structure theorem for graphs of large tree-width
- Turing kernelization for finding long paths in graph classes excluding a topological minor
- Fixed-parameter tractability of treewidth and pathwidth
- Graph minors and parameterized algorithm design
- Graph minor theory
- The Erdős-Pósa property for clique minors in highly connected graphs
- Turing kernelization for finding long paths in graphs excluding a topological minor
- The excluded minor structure theorem with planarly embedded wall
- Linear connectivity forces large complete bipartite minors: an alternative approach
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
- On graph classes with minor-universal elements
- Excluding disjoint Kuratowski graphs
- On the size of two minimal linkages
- Excluding a clique or a biclique in graphs of bounded induced matching treewidth
- Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
- Graph minors. XX: Wagner's conjecture
- Some recent progress and applications in graph minor theory
This page was built for publication: Graph minors. XVII: Taming a vortex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569044)
