LEADER 01159nam a2200325 i 4500 001 991000897459707536 005 20020507175440.0 008 980205s1990 us ||| | eng 020 $a0387971556 035 $ab10772698-39ule_inst 035 $aLE01303997$9ExL 040 $aDip.to Matematica$beng 082 0 $a530.15353 084 $aAMS 76N 084 $aQA1.A647 100 1 $aJoseph, Daniel D.$015382 245 10$aFluid dynamics of viscoelastic liquids /$cDaniel D. Joseph 260 $aNew York :$bSpringer-Verlag,$cc1990 300 $axvii, 755 p. :$bill. (some col.) ;$c25 cm. 490 0 $aApplied mathematical sciences ;$v84 500 $aIncludes bibliographical references (p. [719]-734) and indexes 650 4$aLiquids 650 4$aPartial differential equations 650 4$aViscous flow 907 $a.b10772698$b23-02-17$c28-06-02 912 $a991000897459707536 945 $aLE013 76N JOS11 (1990)$g1$i2013000096186$lle013$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i1087124x$z28-06-02 996 $aFluid dynamics of viscoelastic liquids$983418 997 $aUNISALENTO 998 $ale013$b01-01-98$cm$da $e-$feng$gus $h0$i1 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