000 | 01538cam a22004097a 4500 | ||
---|---|---|---|
001 | 13193 | ||
003 | CUTN | ||
005 | 20140117013002.0 | ||
008 | 100622s2010 gw a b 001 0 eng d | ||
010 | _a 2010931087 | ||
020 | _a9783642142789 (alk. paper) | ||
020 | _a3642142788 (alk. paper) | ||
020 | _a9783642142796 (eISBN) | ||
035 | _a(OCoLC)ocn658045165 | ||
040 |
_aBUF _cBUF _dBUF _dYDXCP _dUMS _dUBF _dAZU _dDLC |
||
041 | 1 |
_aeng _hger |
|
042 | _alccopycat | ||
050 | 0 | 0 |
_aQA166 _b.D51413 2010 |
082 | 0 | 4 |
_a511/.5 _222 |
100 | 1 |
_aDiestel, Reinhard. _zDIE |
|
240 | 1 | 0 |
_aGraphentheorie. _lEnglish |
245 | 1 | 0 |
_aGraph theory / _cReinhard Diestel. |
250 | _a4th ed. | ||
260 |
_aHeidelberg ; _aNew York : _bSpringer, _cc2010. |
||
300 |
_axviii, 436 p. : _bill. ; _c24 cm. |
||
490 | 1 |
_aGraduate texts in mathematics ; _v173 |
|
500 | _aPrevious ed. published: 2000. | ||
504 | _aIncludes bibliographical references and indexes. | ||
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 -- Minors, trees, and WQO. | |
650 | 0 | _aGraph theory. | |
830 | 0 |
_aGraduate texts in mathematics ; _v173. |
|
906 |
_a7 _bcbc _ccopycat _d2 _eepcn _f20 _gy-gencatlg |
||
936 | _aPR 653108368 | ||
942 |
_2ddc _cBOOKS _01 |
||
999 |
_c9833 _d9833 |