LINK [1] A. Huck,“A sufficient condition for graphs to be weakly k-linked,”Graphs and Combinatorics, vol.7, pp.323-351, 1991.

LINK [2] K. Kawarabayashi, Y. Kobayashi and B. Reed,“The disjoint paths problem in quadratic time”,J. Combin. Theory Ser. B, to appear.

LINK [3] N. Robertson and P.D. Seymour,“Graph minors. XIII. The disjoint paths problem,”J. Combin. Theory Ser. B, vol.63, pp.65-110, 1995.

LINK [4] N. Robertson and P.D. Seymour,“Graph minors. XXIII. Nash-Williams'immersion conjecture,”J. Combin. Theory Ser. B, vol.100,pp.181-205, 2010.

LINK [5] R. Thomas and P. Wollan,“An improved linear edge bound for graph linkages,”Eur. J. Comb., vol.26, pp.309-324, 2005.

LINK [6] X. Yu, “Disjoint paths in graphs I, 3-planar graphs and basic obstructions,”Annals of Combinatorics, vol.7, pp.89-103, 2003.

LINK [7] X. Yu,“Disjoint paths in graphs II, a special case,”Annals of Combinatorics, vol.7, pp.105-126, 2003.

LINK [8] X. Yu,“Disjoint paths in graphs III, characterization,”Annals of Combinatorics, vol.7, pp.229-246, 2003.