Journal of Combinatorial Theory, Series B · Volume 99, Issue 3, May 2009, Pages 557-582. Journal of Combinatorial Theory, Series B. Linear connectivity forces ...
The recent paper 'Linear connectivity forces large complete bipartite minors' by Böhme, Kawarabayashi, Maharry and Mohar relies on an extension of Robertson ...
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] · T. Böhme, K. Kawarabayashi, +1 author. B. Mohar · Published in ...
Linear connectivity forces large complete bipartite minors: An alternative approach · J. Fröhlich, Theodor Müller · Published in J. Comb. Theory B 1 November 2011 ...
Let a be an integer. It is proved that for any s and k, there exists a constant N=N(s,k,a) such that every 312(a+1)-connected graph with at least N vertices ...
Bibliographic details on Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]
Jun 15, 2009 · Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case. Authors:Jan-Oliver Fröhlich, Theodor Müller.
Missing: [J. Combin. Theory Ser. B Vol. 99( 2
The recent paper 'Linear connectivity forces large complete bipartite minors' by Bohme, Kawarabayashi, Maharry and Mohar relies on an extension of Robertson ...
Dec 29, 2004 · A graph H is a topological minor of a graph. K if K contains a subgraph which is isomorphic to a graph that can be obtained from H by ...
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]. 323. view. electronic edition via DOI (open access) ...