LEADER 01776nam 2200409 a 450 001 9910696359803321 005 20080115081303.0 035 $a(CKB)5470000002377232 035 $a(OCoLC)190811013 035 $a(EXLCZ)995470000002377232 100 $a20080115d2002 ua 0 101 0 $aeng 135 $aurmn||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGeophysical surveys of the perimeter fortification system at the site of the second Fort Smith, Fort Smith National Historic Site, Fort Smith, Arkansas$b[electronic resource] /$fby Robert K. Nickel and William J. Hunt, Jr 210 1$aLincoln, Neb. :$cU.S. Dept. of the Interior, National Park Service, Midwest Archeological Center,$d2002. 215 $aiv, 48 pages $cdigital, PDF file 225 1 $aTechnical report / Midwest Archeological Center ;$vno. 85 300 $aTitle from title screen (viewed on Jan. 8, 2008). 320 $aIncludes bibliographical references (page 13). 606 $aGeophysics in archaeology$zArkansas$zFort Smith 606 $aArchaeological surveying$zArkansas$zFort Smith 607 $aFort Smith National Historic Site (Fort Smith, Ark.)$xAntiquities 607 $aFort Smith (Ark.)$xAntiquities 615 0$aGeophysics in archaeology 615 0$aArchaeological surveying 700 $aNickel$b Robert K$01404295 701 $aHunt$b William J.$cJr.$01398875 712 02$aMidwest Archeological Center (U.S.) 801 0$bGPO 801 1$bGPO 906 $aBOOK 912 $a9910696359803321 996 $aGeophysical surveys of the perimeter fortification system at the site of the second Fort Smith, Fort Smith National Historic Site, Fort Smith, Arkansas$93531532 997 $aUNINA LEADER 02845nam0 2200589 i 450 001 VAN00114793 005 20250604033019.470 017 70$2N$a978-3-319-33828-6 100 $a20180212d2016 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aGeneralized connectivity of graphs$fXueliang Li, Yaping Mao 210 $a[Cham]$cSpringer$d2016 215 $aX, 143 p.$cill.$d24 cm 410 1$1001VAN00102596$12001 $aSpringerBriefs in mathematics$1210 $aBerlin [etc.]$cSpringer$d2011- 500 1$3VAN00242394$aGeneralized connectivity of graphs$91523360 606 $a05C05$xTrees [MSC 2020]$3VANC022107$2MF 606 $a05C35$xExtremal problems in graph theory [MSC 2020]$3VANC023617$2MF 606 $a05C40$xConnectivity [MSC 2020]$3VANC033597$2MF 606 $a05C70$xEdge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020]$3VANC023636$2MF 606 $a05C75$xStructural characterization of families of graphs [MSC 2020]$3VANC022108$2MF 606 $a05C76$xGraph operations (line graphs, products, etc.) [MSC 2020]$3VANC033956$2MF 606 $a05C80$xRandom graphs (graph-theoretic aspects) [MSC 2020]$3VANC023669$2MF 606 $a05C85$xGraph algorithms (graph-theoretic aspects) [MSC 2020]$3VANC023679$2MF 606 $a68M10$xNetwork design and communication in computer systems [MSC 2020]$3VANC033957$2MF 606 $a68Q25$xAnalysis of algorithms and problem complexity [MSC 2020]$3VANC019860$2MF 606 $a68R10$xGraph theory (including graph drawing) in computer science [MSC 2020]$3VANC023623$2MF 610 $aCombinatorics$9KW:K 610 $aConjectures$9KW:K 610 $aConnectivity of Graphs$9KW:K 610 $aEdge-connectivity$9KW:K 610 $aEdge-disjoint Steiner trees$9KW:K 610 $aExtremal graph theory$9KW:K 610 $aGraph product$9KW:K 610 $aInternally disjoint Steiner trees$9KW:K 610 $aNordhaus-Gaddum-type result$9KW:K 610 $aOpen Problems$9KW:K 610 $aRainbow index of graphs$9KW:K 610 $aSteiner tree$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aLi$bXueliang$3VANV088810$0755922 701 1$aMao$bYaping$3VANV088811$0755923 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20250606$gRICA 856 4 $uhttp://dx.doi.org/10.1007/978-3-319-33828-6$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA CENTRO DI SERVIZIO SBA$2VAN15 912 $fN 912 $aVAN00114793 950 $aBIBLIOTECA CENTRO DI SERVIZIO SBA$d15CONS SBA EBOOK 2272 $e15EB 2272 20180212 996 $aGeneralized connectivity of graphs$91523360 997 $aUNICAMPANIA