000 03499nam a22005295i 4500
001 978-3-662-53622-3
003 DE-He213
005 20221102211556.0
007 cr nn 008mamaa
008 170620s2017 gw | s |||| 0|eng d
020 _a9783662536223
_9978-3-662-53622-3
024 7 _a10.1007/978-3-662-53622-3
_2doi
050 4 _aQA297.4
072 7 _aPBD
_2bicssc
072 7 _aMAT036000
_2bisacsh
072 7 _aPBD
_2thema
082 0 4 _a511.1
_223
100 1 _aDiestel, Reinhard.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_966676
245 1 0 _aGraph Theory
_h[electronic resource] /
_cby Reinhard Diestel.
250 _a5th ed. 2017.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2017.
300 _aXVIII, 428 p. 119 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aGraduate Texts in Mathematics,
_x2197-5612 ;
_v173
505 0 _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 0 _aDiscrete mathematics.
_912873
650 0 _aComputer science—Mathematics.
_931682
650 1 4 _aDiscrete Mathematics.
_912873
650 2 4 _aMathematical Applications in Computer Science.
_931683
710 2 _aSpringerLink (Online service)
_966677
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662536216
776 0 8 _iPrinted edition:
_z9783662536230
776 0 8 _iPrinted edition:
_z9783662571491
776 0 8 _iPrinted edition:
_z9783662575604
830 0 _aGraduate Texts in Mathematics,
_x2197-5612 ;
_v173
_966678
856 4 0 _uhttps://doi.org/10.1007/978-3-662-53622-3
912 _aZDB-2-SMA
912 _aZDB-2-SXMS
942 _cETB
999 _c81698
_d81698