Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
The recent paper 'Linear connectivity forces large complete bipartite minors' by Bohme, 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.