Cette recherche s'applique uniquement aux ressources en bibliothèque.
140 résultats
Trier par:
Ajouter à la liste:
Étendre à toutes les références (sans texte intégral)
    • Plusieurs versions

    Graph theory

    Diestel, Reinhard
    • Livre
    Sélectionner

    Graphentheorie

    Diestel, Reinhard
    Berlin : Springer
    2006
    Recherche de la disponibilité
    Plus…
    Chargement
    Erreur de chargement
    Titre: Graphentheorie / Reinhard Diestel
    Auteur: Diestel, Reinhard
    Edition: 3., neu bearb. und erw. Aufl..
    Editeur: Berlin : Springer
    Date: 2006
    Collation: 344 S. : Ill.
    Sujet RERO: Graphes, Théorie des
    Sujet RERO - forme: [Manuels d'enseignement]
    Classification: DIUF 3.7
    Identifiant: 9783540213918 (ISBN)
    No RERO: R005029792
    Permalien:
    http://data.rero.ch/01-R005029792/html?view=FR_V1

    • Plusieurs versions

    Abstract Separation Systems

    Diestel, Reinhard
    Order, 2018, Vol.35(1), pp.157-170 [Revue évaluée par les pairs]

    • Plusieurs versions

    Ends and tangles

    Diestel, Reinhard
    Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 2017, Vol.87(2), pp.223-244 [Revue évaluée par les pairs]

    • Plusieurs versions

    Rudolf Halin: 1934–2014

    Diestel, Reinhard
    Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 2017, Vol.87(2), pp.197-202 [Revue évaluée par les pairs]

    • Plusieurs versions

    Tree Sets

    Diestel, Reinhard
    Order, 2018, Vol.35(1), pp.171-192 [Revue évaluée par les pairs]

    • Plusieurs versions

    Locally finite graphs with ends: A topological approach, I. Basic theory

    Diestel, Reinhard
    Discrete Mathematics, 2011, Vol.311(15), pp.1423-1447 [Revue évaluée par les pairs]

    • Article
    Sélectionner

    Tangle-tree duality in abstract separation systems

    Diestel, Reinhard
    arXiv.org, Apr 26, 2018
    © ProQuest LLC All rights reserved, Engineering Database, Publicly Available Content Database, ProQuest Engineering Collection, ProQuest Technology Collection, ProQuest SciTech Collection, Materials Science & Engineering Database, ProQuest Central (new), ProQuest Central Korea, SciTech Premium Collection, Technology Collection, ProQuest Central Essentials, ProQuest One Academic, Engineering Collection (ProQuest)
    Disponible
    Plus…
    Titre: Tangle-tree duality in abstract separation systems
    Auteur: Diestel, Reinhard
    Contributeur: Diestel, Reinhard (pacrepositoryorg)
    Sujet: Data Management ; Cohesion ; Substructures ; Image Analysis ; Duality Theorem ; Graphs ; Combinatorial Analysis ; Parameters ; Separation ; Existence Theorems ; Axioms
    Description: We prove a general width duality theorem for combinatorial structures with well-defined notions of cohesion and separation. These might be graphs and matroids, but can be much more general or quite different. The theorem asserts a duality between the existence of high cohesiveness somewhere local and a global overall tree structure. We describe cohesive substructures in a unified way in the format of tangles: as orientations of low-order separations satisfying certain consistency axioms. These axioms can be expressed without reference to the underlying structure, such as a graph or matroid, but just in terms of the poset of the separations themselves. This makes it possible to identify tangles, and apply our tangle-tree duality theorem, in very diverse settings. Our result implies all the classical duality theorems for width parameters in graph minor theory, such as path-width, tree-width, branch-width or rank-width. It yields new, tangle-type, duality theorems for tree-width and path-width....
    Fait partie de: arXiv.org, Apr 26, 2018
    Identifiant: 2331-8422 (E-ISSN)

    • Article
    Sélectionner

    Locally finite graphs with ends: a topological approach

    Diestel, Reinhard
    arXiv.org, Jul 10, 2012
    © ProQuest LLC All rights reserved, Engineering Database, Publicly Available Content Database, ProQuest Engineering Collection, ProQuest Technology Collection, ProQuest SciTech Collection, Materials Science & Engineering Database, ProQuest Central (new), ProQuest Central Korea, SciTech Premium Collection, Technology Collection, ProQuest Central Essentials, ProQuest One Academic, Engineering Collection (ProQuest)
    Disponible
    Plus…
    Titre: Locally finite graphs with ends: a topological approach
    Auteur: Diestel, Reinhard
    Contributeur: Diestel, Reinhard (pacrepositoryorg)
    Sujet: Graphs ; Graph Theory ; Topology ; Combinatorics ; Geometric Topology
    Description: This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles. This approach has made it possible to extend to locally finite graphs many classical theorems of finite graph theory that do not extend verbatim. The shift of paradigm it proposes is thus as much an answer to old questions as a source of new ones; many concrete problems of both types are suggested in the paper. This paper attempts to provide an entry point to this field for readers that have not followed the literature that has emerged in the last 10 years or so. It takes them on a quick route through what appear to be the most important lasting results, introduces them to key proof techniques, identifies the most promising open problems, and offers pointers to the literature for more detail.
    Fait partie de: arXiv.org, Jul 10, 2012
    Identifiant: 2331-8422 (E-ISSN)

    • Article
    Sélectionner

    Forcing finite minors in sparse infinite graphs by large-degree assumptions

    Diestel, Reinhard
    arXiv.org, Sep 24, 2012
    © ProQuest LLC All rights reserved, Engineering Database, Publicly Available Content Database, ProQuest Engineering Collection, ProQuest Technology Collection, ProQuest SciTech Collection, Materials Science & Engineering Database, ProQuest Central (new), ProQuest Central Korea, SciTech Premium Collection, Technology Collection, ProQuest Central Essentials, ProQuest One Academic, Engineering Collection (ProQuest)
    Disponible
    Plus…
    Titre: Forcing finite minors in sparse infinite graphs by large-degree assumptions
    Auteur: Diestel, Reinhard
    Contributeur: Diestel, Reinhard (pacrepositoryorg)
    Sujet: Graphs ; Graph Theory
    Description: Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given finite minor, or a finite subgraph of given minimum degree. This is part of a wider project which seeks to develop an extremal theory of sparse infinite graphs.
    Fait partie de: arXiv.org, Sep 24, 2012
    Identifiant: 2331-8422 (E-ISSN)