Diestel, Reinhard.
Diestel, Reinhard, 1959-....
Reinhard Diestel
VIAF ID: 29614672 ( Personal )
Permalink: http://viaf.org/viaf/29614672
Preferred Forms
- 200 _ | ‡a Diestel ‡b Reinhard
-
-
-
-
-
- 100 1 _ ‡a Diestel, Reinhard
- 100 1 _ ‡a Diestel, Reinhard
- 100 1 0 ‡a Diestel, Reinhard
- 100 1 _ ‡a Diestel, Reinhard
- 100 1 _ ‡a Diestel, Reinhard ‡d 1959-
-
-
- 100 1 _ ‡a Diestel, Reinhard, ‡d 1959-....
-
- 100 0 _ ‡a Reinhard Diestel
4xx's: Alternate Name Forms (23)
Works
Title | Sources |
---|---|
accessibility theorem for infinite graph minors | |
Characterizing dominating graphs | |
classification of finitely spreading graphs | |
conjecture concerning a limit of non-Cayley graphs | |
countable Erdös-Menger conjecture with ends | |
Dense minors in graphs of large girth | |
Directions in infinite graph ... 1992: | |
Dominating functions and topological graph minors | |
end structure of a graph recent results and open problems | |
Excluding a countable clique | |
Graph decompositions | |
Graph theory | |
Graphentheorie | |
Gurafu riron | |
Highly connected sets and the excluded grid theorem | |
Menger's theorem for a countable source set | |
n89670253 | |
Normal spanning trees, Aronszajn trees and excluded minors | |
Normal trees orders for infinite graphs | |
On infinite cycles | |
On spanning trees and κ-connectedness [kappa-connectedness] in infinite graphs | |
On the exclusion of forest minors a short proof of the path width theorem | |
On vertex transitive graphs of infinite degree | |
proof of the bounded graph conjecture | |
Relating subsets of a poset, and a partition theorem for WQOs | |
structure of TKa-free graphs | |
universal planar graph under the minor relation | |
グラフ理論 |