LEADER 01621nam0 2200421 i 450 001 VAN0124119 005 20230703022134.289 017 70$2N$a9783662536223 100 $a20191008d2017 |0itac50 ba 101 $aeng 102 $aDE 105 $a|||| ||||| 200 1 $aGraph theory$fReinhard Diestel 205 $a5. ed 210 $aBerlin$cSpringer$d2017 215 $axviii, 428 p.$cill.$d24 cm 410 1$1001VAN0023579$12001 $aGraduate texts in mathematics$1210 $aNew York [etc.]$cSpringer$v173 500 1$3VAN0235638$aGraphentheorie$92493921 606 $a05-XX$xCombinatorics [MSC 2020]$3VANC019812$2MF 606 $a05Cxx$xGraph theory [MSC 2020]$3VANC022400$2MF 610 $aCombinatorics$9KW:K 610 $aDiscrete mathematics$9KW:K 610 $aFinite and infinite Graphs$9KW:K 610 $aGraph Minors$9KW:K 610 $aGraph theory$9KW:K 610 $aGraphs$9KW:K 610 $aMatching$9KW:K 620 $dBerlin$3VANL000066 700 1$aDiestel$bReinhard$3VANV044593$061926 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240614$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-662-53622-3$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $fN 912 $aVAN0124119 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 0699 $e08eMF699 20191008 996 $aGraphentheorie$92493921 997 $aUNICAMPANIA