tailieunhanh - Sách: Graph Theory

Clear, lively style covers all basics of theory and application, including mathematical models, elementary concepts of graph theory, transportation problems, connection problems, party problems, diagraphs and mathematical models, games and puzzles, graphs and social psychology, planar graphs and coloring problems, and graphs and other mathematics. | Reinhard Diestel Electronic Edition 2000 Springer-Verlag New York Reinhard Diestel Graph Theory Electronic Edition 2000 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 http home diestel books http supplements diestel Preface Almost two decades have passed since the appearance of those graph theory texts that still set the agenda for most introductory courses taught today. The canon created by those books has helped to identify some main fields of study and research and will doubtless continue to influence the development of the discipline for some time to come. 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 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 invariants such as average degree and chromatic number how probabilistic methods and the regularity lemma have pervaded extremal graph theory and Ramsey theory or how the entirely new field 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 .