000 02407nmm a22002415i 4500
005 20230705150633.0
008 170620s2017 gw | s |||| 0|eng d
020 _a9783662536223
_9978-3-662-53622-3
082 _a511.1
_223
100 _aDiestel, Reinhard.
_920244
245 _aGraph Theory
_h[electronic resource] /
_cby Reinhard Diestel.
250 _a5th ed. 2017.
260 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2017.
300 _aXVIII, 428 p. 119 illus.
_bonline resource.
505 _aThe Basics -- Matching Covering and Packing -- Connectivity -- Planar Graphs -- Colouring -- Flows -- Extremal Graph Theory -- Infinite Graphs -- Ramsey Theory for Graphs -- Hamilton Cycles -- Random Graphs -- Graph Minors.
520 _aThis standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: "This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory."Acta Scientiarum Mathematiciarum "Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. "Persi Diaconis & Ron Graham, SIAM Review "The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theory." Bulletin of the Institute of Combinatorics and its Applications "Succeeds dramatically ... a hell of a good ook." MAA Reviews "A highlight of the book is what is by far the best account in print of the Seymour-Robertson theory of graph minors." Mathematika " ... like listening to someone explain mathematics." Bulletin of the AMS.
650 _aDiscrete mathematics.
_920245
650 _aComputer science-Mathematics.
_920246
650 _aDiscrete Mathematics.
_920247
650 _aMathematical Applications in Computer Science.
_920248
856 _uhttps://doi.org/10.1007/978-3-662-53622-3
942 _cEBK
999 _c13621
_d13621