Linear connectivity forces large complete bipartite minors: an alternative approach
From MaRDI portal
Publication:651041
DOI10.1016/j.jctb.2011.02.002zbMath1234.05221MaRDI 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 minor; vortex structure; path-decomposition; Euler's formula; tree-width; tree-decomposition; graphs on surfaces; complete bipartite minor; grid minor; near embedding
Related Items
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor, The structure of graphs not admitting a fixed immersion, The \(\mathbb{Z}_2\)-genus of Kuratowski minors, Turing kernelization for finding long paths in graph classes excluding a topological minor
Cites Work