LEADER 00962cam2-22003251i-450 001 990005519070403321 005 20210906114416.0 035 $a000551907 035 $aFED01000551907 035 $a(Aleph)000551907FED01 035 $a000551907 100 $a19990604d1976----km-y0itay50------ba 101 1 $aita$cger 102 $aIT 105 $ay---f---001yy 200 1 $aLetteratura, 2$fa cura di Gabriele Scaramuzza 210 $aMilano$cFeltrinelli$d1976 215 $aV, 309 p.$d18 cm 454 0$12001$aLiteratur$957493 461 0$1001000551808$12001$aEnciclopedia Feltrinelli Fischer$v37 702 1$aScaramuzza,$bGabriele$f<1939- > 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990005519070403321 952 $aCOLL. 88 (37)$bBIBL. 50590$fFLFBC 952 $aFCL 679 (37)$bIst.Fil.Cl.s.i.$fFLFBC 952 $aFCL 679 (37BIS)$bIst.Fil.Cl.s.i.$fFLFBC 959 $aFLFBC 996 $aLiteratur$957493 997 $aUNINA LEADER 03710nam 22007095 450 001 9910300141803321 005 20251116154147.0 010 $a1-4939-0305-5 024 7 $a10.1007/978-1-4939-0305-4 035 $a(CKB)2550000001198375 035 $a(EBL)1698084 035 $a(OCoLC)878921602 035 $a(SSID)ssj0001176327 035 $a(PQKBManifestationID)11760523 035 $a(PQKBTitleCode)TC0001176327 035 $a(PQKBWorkID)11130418 035 $a(PQKB)11313577 035 $a(MiAaPQ)EBC1698084 035 $a(DE-He213)978-1-4939-0305-4 035 $a(PPN)176101853 035 $a(EXLCZ)992550000001198375 100 $a20140124d2014 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aCovering walks in graphs /$fby Futaba Fujie, Ping Zhang 205 $a1st ed. 2014. 210 1$aNew York, NY :$cSpringer New York :$cImprint: Springer,$d2014. 215 $a1 online resource (123 p.) 225 1 $aSpringerBriefs in Mathematics,$x2191-8198 300 $aDescription based upon print version of record. 311 08$a1-4939-0304-7 320 $aIncludes bibliographical references and index. 327 $a1. Eulerian Walks -- 2. Hamiltonian Walks -- 3. Traceable Walks -- References -- Index. . 330 $aCovering Walks  in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous K?nigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Hamiltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works for several well-known Hamiltonian concepts and produce interesting new results. 410 0$aSpringerBriefs in Mathematics,$x2191-8198 606 $aGraph theory 606 $aCombinatorial analysis 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003 615 0$aGraph theory. 615 0$aCombinatorial analysis. 615 0$aApplied mathematics. 615 0$aEngineering mathematics. 615 14$aGraph Theory. 615 24$aCombinatorics. 615 24$aApplications of Mathematics. 676 $a511.5 700 $aFujie$b Futaba$4aut$4http://id.loc.gov/vocabulary/relators/aut$0721699 702 $aZhang$b Ping$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910300141803321 996 $aCovering Walks in Graphs$92512353 997 $aUNINA