文档介绍：Reinhard Diestel
Graph Theory
Electronic Edition 2000
c Springer-Verlag New York 1997, 2000
This is an electronic version of the second (2000) edition of the above
Springer book, from their series Graduate Texts in Mathematics, vol. 173.
The cross-references in the text and in the margins are active links: click
on them to be taken to the appropriate page.
The printed edition of this book can be ordered from your bookseller, or
electronically from Springer through the Web sites referred to below.
Softcover $, ISBN 0-387-98976-5
Hardcover $, ISBN 0-387-95014-1
Further information (reviews, errata, free copies for lecturers etc.) and
electronic order forms can be found on
/
/supplements/diestel/
Preface
Almost two decades have passed since the appearance of those graph the-
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
elds of study and research, and will doubtless continue to in
uence
the development of the discipline for some time e.
Yet much has happened in those 20 years, in graph theory no less
than elsewhere: deep new theorems have been found, seemingly disparate
methods and results have e 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 invari-
ants such as average degree and chromatic number, how probabilistic
methods and the regularity lemma have pervaded extremal graph theo-
ry and Ramsey theory, or how the entirely new
eld of graph minors and
tree-positions has brought standard methods of surface topology
to bear on long-standing algorithmic graph problems.
Clearly, then, the time e 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