Authors: Diestel, R Leader, I

Citation: R. Diestel et I. Leader, Normal spanning trees, Aronszajn trees and excluded minors, J LOND MATH, 63, 2001, pp. 16-32

Authors: Diestel, R

Citation: R. Diestel, An accessibility theorem for infinite graph minors, J GRAPH TH, 35(4), 2000, pp. 273-277

Authors: Diestel, R Kuhn, D

Citation: R. Diestel et D. Kuhn, A universal planar graph under the minor relation, J GRAPH TH, 32(2), 1999, pp. 191-206

Authors: Diestel, R Thomas, R

Citation: R. Diestel et R. Thomas, Excluding a countable clique, J COMB TH B, 76(1), 1999, pp. 41-67

Authors: Diestel, R Jensen, TR Gorbunov, KY Thomassen, C

Citation: R. Diestel et al., Highly connected sets and the excluded grid theorem, J COMB TH B, 75(1), 1999, pp. 61-73