Title of article
Linear connectivity forces large complete bipartite minors: An alternative approach
Author/Authors
Frِhlich، نويسنده , , Jan-Oliver and Müller، نويسنده , , Theodor، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
7
From page
502
To page
508
Abstract
The recent paper ‘Linear connectivity forces large complete bipartite minors’ by Böhme, Kawarabayashi, Maharry and Mohar relies on an extension of Robertson and Seymourʼs structure theorem for graphs with a forbidden minor. We describe a more direct approach which uses just the original structure theorem.
Keywords
tree-width , Tree-decomposition , path-decomposition , Complete bipartite minor , grid minor , Near embedding , Euler?s formula , Vortex structure , graph minor , graphs on surfaces
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2011
Journal title
Journal of Combinatorial Theory Series B
Record number
1528166
Link To Document