Linear connectivity forces large complete bipartite minors: an alternative approach
From MaRDI portal
Publication:651041
DOI10.1016/J.JCTB.2011.02.002zbMath1234.05221OpenAlexW2124412391MaRDI QIDQ651041
Theodor Müller, Jan-Oliver Fröhlich
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
graph minorvortex structurepath-decompositionEuler's formulatree-widthtree-decompositiongraphs on surfacescomplete bipartite minorgrid minornear embedding
Related Items (4)
The \(\mathbb{Z}_2\)-genus of Kuratowski minors ⋮ The structure of graphs not admitting a fixed immersion ⋮ Turing kernelization for finding long paths in graph classes excluding a topological minor ⋮ Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
Cites Work
This page was built for publication: Linear connectivity forces large complete bipartite minors: an alternative approach