Graph Theory /

This 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...

Full description

Saved in:
Bibliographic Details
Main Author: Diestel, Reinhard (Author)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2017.
Edition:Fifth Edition.
Series:Graduate texts in mathematics ; 173.
Subjects:
Online Access:Connect to this title online

MARC

LEADER 00000nam a22000005i 4500
001 b3111213
005 20240627103850.0
006 m o d
007 cr |||||||||||
008 170620s2017 gw | o |||| 0|eng d
020 |a 9783662536223 
024 7 |a 10.1007/978-3-662-53622-3  |2 doi 
035 |a (DE-He213)spr978-3-662-53622-3 
040 |d UtOrBLW 
050 4 |a QA164-167.2 
100 1 |a Diestel, Reinhard,  |e author.  |0 http://id.loc.gov/authorities/names/n89670253 
245 1 0 |a Graph Theory /  |c by Reinhard Diestel. 
250 |a Fifth Edition. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2017. 
300 |a 1 online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Graduate Texts in Mathematics,  |x 0072-5285 ;  |v 173 
505 0 |a The 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 |a This 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 book.” 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 |a Combinatorial analysis.  |0 http://id.loc.gov/authorities/subjects/sh85028802 
650 0 |a Computer science  |x Mathematics.  |0 http://id.loc.gov/authorities/subjects/sh85042295 
650 0 |a Mathematics.  |0 http://id.loc.gov/authorities/subjects/sh85082139 
650 1 4 |a Mathematics. 
650 2 4 |a Combinatorics. 
650 2 4 |a Math Applications in Computer Science. 
650 7 |a Combinatorial analysis.  |2 fast  |0 (OCoLC)fst00868961 
650 7 |a Computer science  |x Mathematics.  |2 fast  |0 (OCoLC)fst00872460 
650 7 |a Computer science.  |2 fast  |0 (OCoLC)fst00872451 
650 7 |a Mathematics.  |2 fast  |0 (OCoLC)fst01012163 
740 0 |a Springer Mathematics and Statistics 
776 0 8 |i Printed edition:  |z 9783662536216 
830 0 |a Graduate texts in mathematics ;  |v 173.  |0 http://id.loc.gov/authorities/names/n83723435 
856 4 0 |u https://login.libproxy.scu.edu/login?url=https://dx.doi.org/10.1007/978-3-662-53622-3  |z Connect to this title online  |t 0 
907 |a .b31112134  |b 240629  |c 171208 
918 |a .bckstg  |b 2016-12-01 
919 |a .ulebk  |b 2017-02-14 
998 |a uww  |b 171208  |c m  |d z   |e l  |f eng  |g gw   |h 0 
999 f f |i be53cccd-876f-5b74-8ae2-bec7951407b2  |s 5a64b0b8-03b6-555e-9a25-8368f9498042  |t 0