WorldCat Identities

Diestel, Reinhard

Overview
Works: 78 works in 211 publications in 4 languages and 2,890 library holdings
Roles: Editor, Creator
Classifications: QA166, 511.5
Publication Timeline
Key
Publications about  Reinhard Diestel Publications about Reinhard Diestel
Publications by  Reinhard Diestel Publications by Reinhard Diestel
Most widely held works by Reinhard Diestel
Graph theory by Reinhard Diestel ( Book )
63 editions published between 1997 and 2012 in 3 languages and held by 2,081 WorldCat member libraries worldwide
This book is a concise, yet carefully written, introduction to modern graph theory, covering all its recent developments. It can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more advanced methods of that field. This second edition extends the first in two ways. It offers a thoroughly revised and updated chapter on graph minors, which now includes full new proofs of two of the central Robertson-Seymor theorems (as well as a detailed sketch of the entire proof of their celebrated Graph Minor Theorem). Second, there is now a section of hints for all the exercises, to enhance their value for bith individual study and classroom use
Graph decompositions : a study in infinite graph theory by Reinhard Diestel ( Book )
9 editions published between 1990 and 2002 in English and Undetermined and held by 274 WorldCat member libraries worldwide
Graphentheorie by Reinhard Diestel ( Book )
16 editions published between 1996 and 2012 in German and English and held by 272 WorldCat member libraries worldwide
HauptbeschreibungDetailliert und klar, sowie stets mit Blick auf das Wesentliche, führt dieses Buchin die Graphentheorie ein. Zu jedem Themenkomplex stellt es sorgfältig dieGrundlagen dar und beweist dann ein oder zwei tiefere typische Sätze, oftmalsergänzt durch eine informelle Diskussion ihrer tragenden Ideen. Es vermitteltso exemplarisch die wichtigsten Methoden der heutigen Graphentheorie, einschließlich moderner Techniken wie Regularitätslemma, Zufallsgraphen, Baumzerlegungen und Minoren.€Rezension"Eine hervorragende und mit größter Sorgfalt geschriebene Einführung in diemoderne Graphe
Directions in infinite graph theory and combinatorics by Reinhard Diestel ( Book )
7 editions published between 1991 and 1992 in English and held by 58 WorldCat member libraries worldwide
On the exclusion of forest minors : a short proof of the path-width theorem by Reinhard Diestel ( Book )
2 editions published in 1994 in German and English and held by 7 WorldCat member libraries worldwide
The countable Erdös-Menger conjecture with ends by Reinhard Diestel ( Book )
3 editions published in 2002 in English and held by 7 WorldCat member libraries worldwide
A conjecture concerning a limit of non-cayley graphs by Reinhard Diestel ( Book )
3 editions published between 2000 and 2002 in English and held by 6 WorldCat member libraries worldwide
Topological paths, cycles and spanning trees in infinite graphs by Reinhard Diestel ( Book )
3 editions published in 2001 in English and held by 6 WorldCat member libraries worldwide
Menger's theorem for a countable source set by Ron Aharoni ( Book )
2 editions published in 1993 in German and English and held by 6 WorldCat member libraries worldwide
Graph-theoretical versus topological ends of graphs by Reinhard Diestel ( Book )
3 editions published in 2001 in English and held by 6 WorldCat member libraries worldwide
A universal planar graph under the minor relation by Reinhard Diestel ( Book )
3 editions published between 2000 and 2002 in English and held by 6 WorldCat member libraries worldwide
Excluding a countable clique by Reinhard Diestel ( Book )
3 editions published between 1998 and 2000 in English and held by 6 WorldCat member libraries worldwide
Normal spanning trees, Aronszajn trees and excluded minors by Reinhard Diestel ( Book )
3 editions published between 2000 and 2002 in English and held by 6 WorldCat member libraries worldwide
On infinite cycles by Reinhard Diestel ( Book )
3 editions published in 2002 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Normal trees orders for infinite graphs by Jean-Michel Brochet ( Book )
2 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide
Two short proofs concerning tree-decompositions by Reinhard Diestel ( Book )
2 editions published in 2001 in English and held by 5 WorldCat member libraries worldwide
An accessibility theorem for infinite graph minors by Reinhard Diestel ( Book )
3 editions published between 2000 and 2002 in English and held by 5 WorldCat member libraries worldwide
Relating subsets of a poset, and a partition theorem for WQOs by Reinhard Diestel ( Book )
4 editions published between 2001 and 2002 in English and held by 5 WorldCat member libraries worldwide
Gurafu riron by Reinhard Diestel ( Book )
3 editions published in 2000 in Japanese and held by 5 WorldCat member libraries worldwide
Wegesysteme by Frank Göring ( )
1 edition published in 2002 in German and held by 4 WorldCat member libraries worldwide
Wegesysteme werden als Graphen abstrahiert, sodaß als natürliche Enthaltenseinsrelation von Graphen die topologische Minorenrelation betrachtet wird. Durch das Fixieren bestimmter Knotenpunkte des topologischen Minors im großen Graphen wird diese Ordnungsrelation spezialisiert, sodaß Existenzsätze über Wegesysteme eine einfache Formulierung bekommen. Zu Mengers Theorem über die Existenz eines bestimmten Wegesystems werden drei kurze und neue Beweise gegeben. Einer dieser Beweise liefert sowohl eine neue Version des Theorems, die die Vorschreibbarkeit der Start- und Endknoten eines nicht maximalen Wegesystems für ein maximales Wegesystem beinhaltet, als auch einen leicht implementierbaren linearen Algorithmus zum Auffinden dieses Wegesystems. Es wird gezeigt, daß diese Version bekannte Theoreme der Transversaltheorie wie Halls Heiratssatz und das Theorem über gemeinsame Transversalen von Ford und Fulkerson als Spezialfälle hat. Auch für Maders Theorem über die Zahl unabhängiger H-Wege wird die Vorschreibbarkeit der Startknoten gezeigt. Die neue Version von Mengers Theorem wird darüber hinaus verwendet, um ein Verfahren zu begründen, mit welchem untersucht werden kann, ob aus gewissen Zusammenhangsvoraussetzungen (evtl. kombiniert mit einem gegebenen Wegesystem) in einem Graphen die Existenz eines gesuchten Wegesystems folgt. Das Verfahren ist konstruktiv. Entweder findet es ein Gegenbeispiel, also einen Graphen mit den gegebenen Voraussetzungen, der das gesuchte Wegesystem nicht enthält, oder es liefert einen Algorithmus, welcher linear in der Zahl der Knoten und Kanten des gegebenen Graphen das gesuchte Wegesystem findet. Genauer wird bei Eingabe eines beliebigen Graphen entweder einen Trenner gefunden, der beweist, daß die Zusammenhangsvoraussetzung nicht gegeben ist, oder das gesuchte Wegesystem selbst wird konstruiert. An Beispielen wird die Funktionsweise des Verfahren demonstriert: Es werden zwei Existenzsätze über Kreise durch vorgeschriebene Knoten eines gegebenen Graphen damit hergeleitet
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.62 (from 0.29 for Menger's t ... to 0.84 for Graph deco ...)
Alternative Names
Diestel, R.
Diestel, R. 1959-
Diestel, R. (Reinhard)
Dīsuteru, R. 1959-
R.ディーステル.
ディーステル, R
Languages
English (113)
German (19)
Japanese (3)
Spanish (1)
Covers