LEADER 03142nam  22005415  450 
001 9910983304303321
005 20250512143802.0
010   $a9783662701072
010   $a3662701073
024 7 $a10.1007/978-3-662-70107-2
035   $a(CKB)37407508700041
035   $a(DE-He213)978-3-662-70107-2
035   $a(MiAaPQ)EBC32011551
035   $a(Au-PeEL)EBL32011551
035   $a(EXLCZ)9937407508700041
100   $a20250408d2025      u|         0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aGraph Theory /$fby Reinhard Diestel
205   $a6th ed. 2025.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2025.
215   $a1 online resource (XX, 455 p.)
225 1 $aGraduate Texts in Mathematics,$x2197-5612 ;$v173
311 08$a9783662701065 
311 08$a3662701065 
327   $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.
330   $aThis standard textbook on modern graph theory 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 complete proofs, while offering glimpses of more advanced methods in each field via one or two deeper results. This is a major new edition. Among many other improvements, it offers additional tools for applying the regularity lemma, brings the tangle theory of graph minors up to the cutting edge of current research, and addresses new topics such as chi-boundedness in perfect graph theory. The book can be used as a reliable text for an introductory graduate course and is also suitable for self-study. From the reviews: ?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 book.? MAA Reviews ? ... like listening to someone explain mathematics.? Bulletin of the AMS .
410  0$aGraduate Texts in Mathematics,$x2197-5612 ;$v173
606   $aDiscrete mathematics
606   $aComputer science$xMathematics
606   $aDiscrete Mathematics
606   $aMathematical Applications in Computer Science
615  0$aDiscrete mathematics.
615  0$aComputer science$xMathematics.
615 14$aDiscrete Mathematics.
615 24$aMathematical Applications in Computer Science.
676   $a511.1
700   $aDiestel$b Reinhard$4aut$4http://id.loc.gov/vocabulary/relators/aut$061926
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910983304303321
996   $aGraphentheorie$92493921
997   $aUNINA