LEADER 02378nam0 2200565 i 450 001 VAN0124591 005 20230628122753.276 017 70$2N$a9783319718408 100 $a20191022d2018 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aClasses of Directed Graphs$fJørgen Bang-Jensen, Gregory Gutin editors 210 $aCham$cSpringer$d2018 215 $axxii, 636 p.$cill.$d24 cm 410 1$1001VAN0030486$12001 $aSpringer monographs in mathematics$1210 $aBerlin [etc.]$cSpringer 500 1$3VAN0236157$aClasses of Directed Graphs$91564674 606 $a94A60$xCryptography [MSC 2020]$3VANC019699$2MF 606 $a68Wxx$xAlgorithms in computer science [MSC 2020]$3VANC021296$2MF 606 $a05Cxx$xGraph theory [MSC 2020]$3VANC022400$2MF 606 $a90C27$xCombinatorial optimization [MSC 2020]$3VANC031074$2MF 606 $a94C15$xApplications of graph theory to circuits and networks [MSC 2020]$3VANC031126$2MF 610 $aAcyclic digraphs$9KW:K 610 $aAlgorithm analysis and problem complexity$9KW:K 610 $aDirected graphs$9KW:K 610 $aDirected graphs classes$9KW:K 610 $aDirected width parameters$9KW:K 610 $aDisjoint paths$9KW:K 610 $aEuler digraphs$9KW:K 610 $aFeedback sets$9KW:K 610 $aGraph branchings$9KW:K 610 $aGraph connectivity$9KW:K 610 $aGraph products$9KW:K 610 $aHamiltonian cycles$9KW:K 610 $aHamiltonian paths$9KW:K 610 $aOrientations of graphs$9KW:K 610 $aPlanar digraphs$9KW:K 610 $aTournaments generalizations$9KW:K 620 $aCH$dCham$3VANL001889 702 1$aBang-Jensen$bJørgen$3VANV096020 702 1$aGutin$bGregory$3VANV096021 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240614$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-319-71840-8$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 $aVAN0124591 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 1061 $e08eMF1061 20191022 996 $aClasses of Directed Graphs$91564674 997 $aUNICAMPANIA