LEADER 01032nam0-2200301---450- 001 990010049560403321 005 20160303112215.0 035 $a001004956 035 $aFED01001004956 035 $a(Aleph)001004956FED01 035 $a001004956 100 $a20160303d1981----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $aa---a---001yy 200 1 $aEffetti della rivoluzione industriale sul costruire$eepisodi del costruire prima e dopo la rivoluzione industriale$fGianni V. Galliani 210 $aGenova$cECIG$d1981 215 $a94, 110 p.$cill.$d21x21 cm 225 1 $aQuaderni sull'evoluzione dell'habitat e della tecnologia dell'architettura$v3 300 $aIn testa al frontespizio: Università di Genova, Facoltà di Architettura 700 1$aGalliani,$bGianni V.$011174 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990010049560403321 952 $a12.667$fDARST 959 $aDARST 996 $aEffetti della rivoluzione industriale sul costruire$91499188 997 $aUNINA LEADER 03236nam 22005415 450 001 9910300100203321 005 20200630062505.0 010 $a3-319-89617-2 024 7 $a10.1007/978-3-319-89617-5 035 $a(CKB)4100000004243927 035 $a(DE-He213)978-3-319-89617-5 035 $a(MiAaPQ)EBC5394430 035 $a(PPN)227404319 035 $a(EXLCZ)994100000004243927 100 $a20180514d2018 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aProperly Colored Connectivity of Graphs /$fby Xueliang Li, Colton Magnant, Zhongmei Qin 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (VIII, 145 p. 34 illus.) 225 1 $aSpringerBriefs in Mathematics,$x2191-8198 311 $a3-319-89616-4 327 $a1. Introduction -- 2.General Results -- 3. Connectivity Conditions -- 4. Degree Conditions -- 5. Domination Conditions -- 6. Operations on Graphs -- 7..Random Graphs -- 8. Proper k-Connection and Strong Proper Connection -- 9. Proper Vertex Connection and Total Proper Connection -- 10. Directed Graphs -- 11. Other Generalizations -- 12. Computational Complexity -- Bibliography -- Index. 330 $aA comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area. 410 0$aSpringerBriefs in Mathematics,$x2191-8198 606 $aCombinatorial analysis 606 $aGraph theory 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020 615 0$aCombinatorial analysis. 615 0$aGraph theory. 615 14$aCombinatorics. 615 24$aGraph Theory. 676 $a511.5 700 $aLi$b Xueliang$4aut$4http://id.loc.gov/vocabulary/relators/aut$0755922 702 $aMagnant$b Colton$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aQin$b Zhongmei$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910300100203321 996 $aProperly Colored Connectivity of Graphs$92113539 997 $aUNINA