Linear connectivity forces large complete bipartite minors: an alternative approach
From MaRDI portal
(Redirected from Publication:651041)
Recommendations
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XVII: Taming a vortex
- Linear connectivity forces large complete bipartite minors
- The excluded minor structure theorem with planarly embedded wall
Cited in
(7)- Linear connectivity forces large complete bipartite minors: [J. Combin. Theory ser. B vol. 99, issue 2]
- Turing kernelization for finding long paths in graph classes excluding a topological minor
- Turing kernelization for finding long paths in graphs excluding a topological minor
- Linear connectivity forces large complete bipartite minors
- The structure of graphs not admitting a fixed immersion
- Forcing a Kr minor by high external connectivity
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors
This page was built for publication: Linear connectivity forces large complete bipartite minors: an alternative approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651041)