LEADER 02345nam0 2200577 i 450 001 VAN00124945 005 20240806100817.690 017 70$2N$a9783319896175 100 $a20191028d2018 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aProperly Colored Connectivity of Graphs$fXueliang Li, Colton Magnant, Zhongmei Qin 210 $aCham$cSpringer$d2018 215 $aviii, 145 p.$cill.$d24 cm 410 1$1001VAN00102596$12001 $aSpringerBriefs in mathematics$1210 $aBerlin [etc.]$cSpringer$d2011- 500 1$3VAN00236444$aProperly Colored Connectivity of Graphs$91563722 606 $a05-XX$xCombinatorics [MSC 2020]$3VANC019812$2MF 606 $a05Cxx$xGraph theory [MSC 2020]$3VANC022400$2MF 610 $aChromatic graph theory$9KW:K 610 $aCombinations of Graphs$9KW:K 610 $aCombinatorics$9KW:K 610 $aConnections of graphs$9KW:K 610 $aDegree Conditions$9KW:K 610 $aDirected graphs$9KW:K 610 $aDistance in graphs$9KW:K 610 $aEdge-colored graphs$9KW:K 610 $aEdge-coloring$9KW:K 610 $aGraph connectivity$9KW:K 610 $aHamilton connections$9KW:K 610 $aMinimum spanning subgraphs$9KW:K 610 $aOperations on graphs$9KW:K 610 $aProper Vertex Connection$9KW:K 610 $aProper coloring$9KW:K 610 $aProperly colored connectivity$9KW:K 610 $aRandom graphs$9KW:K 610 $aStrong Proper Connection$9KW:K 610 $aVertex coloring$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aLi$bXueliang$3VANV088810$0755922 701 1$aMagnant$bColton$3VANV096372$0767884 701 1$aQin$bZhongmei$3VANV096373$0767885 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20241115$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-319-89617-5$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 $aVAN00124945 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08DLOAD e-book 1320 $e08eMF1320 20191028 996 $aProperly Colored Connectivity of Graphs$91563722 997 $aUNICAMPANIA