| 000 | 01247cam a2200325 i 4500 | ||
|---|---|---|---|
| 001 | 16295895 | ||
| 003 | EG-ScBUE | ||
| 005 | 20240905090628.0 | ||
| 008 | 100622t2010 gw a f 001 0 eng d | ||
| 020 | _a9783642142789 (alk. paper) | ||
| 020 | _a3642142788 (alk. paper) | ||
| 040 |
_aBUF _beng _erda _cBUF _dBUF _dYDXCP _dUMS _dUBF _dAZU _dDLC _dEG-ScBUE |
||
| 041 | 1 |
_aeng _hger |
|
| 082 | 0 | 4 |
_a511.5 _222 _bDIE |
| 100 | 1 |
_aDiestel, Reinhard, _eauthor. _939286 |
|
| 240 | 1 | 0 |
_aGraphentheorie. _lEnglish |
| 245 | 1 | 0 |
_aGraph theory / _cReinhard Diestel. |
| 250 | _aFourth edition. | ||
| 264 |
_aHeidelberg : _bSpringer, _c[2010] |
||
| 264 | 4 | _cc2010 | |
| 300 |
_axviii, 436 pages : _billustrations ; _c24 cm. |
||
| 490 | 0 |
_aGraduate texts in mathematics ; _v173 |
|
| 500 | _aIncludes index. | ||
| 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. | |
| 546 | _aText in English ; translated from original German. | ||
| 650 | 7 |
_aGraph theory. _2BUEsh _93997 |
|
| 653 |
_bCOMSCI _cJuly2015 _cFebruary2016 |
||
| 655 | _vReading book | ||
| 942 |
_2ddc _cBB |
||
| 999 |
_c20232 _d20204 |
||