Linear connectivity forces large complete bipartite minors: an alternative approach
DOI10.1016/J.JCTB.2011.02.002zbMATH Open1234.05221OpenAlexW2124412391MaRDI QIDQ651041FDOQ651041
Authors: Jan-Oliver Fröhlich, Theodor Müller
Publication date: 8 December 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.02.002
Recommendations
tree-decompositiongraph minorgraphs on surfacestree-widthEuler's formulavortex structurecomplete bipartite minorgrid minornear embeddingpath-decomposition
Cites Work
Cited In (7)
- Linear connectivity forces large complete bipartite minors
- Linear connectivity forces large complete bipartite minors: [J. Combin. Theory ser. B vol. 99, issue 2]
- The structure of graphs not admitting a fixed immersion
- Turing kernelization for finding long paths in graph classes excluding a topological minor
- Forcing a Kr minor by high external connectivity
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors
- Turing kernelization for finding long paths in graphs excluding a topological minor
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)