Bibliographic Information

Graph theory

Reinhard Diestel

(Graduate texts in mathematics, 173)

Springer, c2010

4th ed

Available at  / 69 libraries

Search this Book/Journal

Note

"With 122 illustrations."

Includes bibliographical references and indexes

Description and Table of Contents

Description

Almosttwodecadeshavepassedsincetheappearanceofthosegrapht- ory texts that still set the agenda for most introductory courses taught today. The canon created by those books has helped to identify some main?eldsofstudyandresearch,andwilldoubtlesscontinuetoin?uence the development of the discipline for some time to come. Yet much has happened in those 20 years, in graph theory no less thanelsewhere: deepnewtheoremshavebeenfound,seeminglydisparate methods and results have become interrelated, entire new branches have arisen. To name just a few such developments, one may think of how the new notion of list colouring has bridged the gulf between inva- ants such as average degree and chromatic number, how probabilistic methods andtheregularity lemmahave pervadedextremalgraphtheory and Ramsey theory, or how the entirely new ?eld of graph minors and tree-decompositions has brought standard methods of surface topology to bear on long-standing algorithmic graph problems. Clearly, then, the time has come for a reappraisal: what are, today, the essential areas, methods and results that should form the centre of an introductory graph theory course aiming to equip its audience for the most likely developments ahead? I have tried in this book to o?er material for such a course. In view of the increasing complexity and maturity of the subject, I have broken with the tradition of attempting to cover both theory and app- cations: this book o?ers an introduction to the theory of graphs as part of (pure) mathematics; it contains neither explicit algorithms nor `real world' applications.

Table of Contents

The Basics.- Matching Covering and Packing.- Connectivity.- Planar Graphs.- Colouring.- Flows.- Extremal Graph Theory.- Infinite Graphs.- Ramsey Theory for Graphs.- Hamilton Cycles.- Random Graphs.- Minors Trees and WQO.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BB02799690
  • ISBN
    • 9783642142789
  • LCCN
    2010931087
  • Country Code
    gw
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Heidelberg
  • Pages/Volumes
    xviii, 436 p.
  • Size
    24 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top