| 000 | 02848nam a22004695i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4939-0305-4 | ||
| 003 | DE-He213 | ||
| 005 | 20140220082506.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 140124s2014 xxu| s |||| 0|eng d | ||
| 020 |
_a9781493903054 _9978-1-4939-0305-4 |
||
| 024 | 7 |
_a10.1007/978-1-4939-0305-4 _2doi |
|
| 050 | 4 | _aQA166-166.247 | |
| 072 | 7 |
_aPBV _2bicssc |
|
| 072 | 7 |
_aMAT013000 _2bisacsh |
|
| 082 | 0 | 4 |
_a511.5 _223 |
| 100 | 1 |
_aFujie, Futaba. _eauthor. |
|
| 245 | 1 | 0 |
_aCovering Walks in Graphs _h[electronic resource] / _cby Futaba Fujie, Ping Zhang. |
| 264 | 1 |
_aNew York, NY : _bSpringer New York : _bImprint: Springer, _c2014. |
|
| 300 |
_aXIV, 110 p. 37 illus., 11 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSpringerBriefs in Mathematics, _x2191-8198 |
|
| 505 | 0 | _a1. Eulerian Walks -- 2. Hamiltonian Walks -- 3. Traceable Walks -- References -- Index. . | |
| 520 | _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. | ||
| 650 | 0 | _aMathematics. | |
| 650 | 0 | _aCombinatorics. | |
| 650 | 1 | 4 | _aMathematics. |
| 650 | 2 | 4 | _aGraph Theory. |
| 650 | 2 | 4 | _aCombinatorics. |
| 650 | 2 | 4 | _aApplications of Mathematics. |
| 700 | 1 |
_aZhang, Ping. _eauthor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9781493903047 |
| 830 | 0 |
_aSpringerBriefs in Mathematics, _x2191-8198 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-1-4939-0305-4 |
| 912 | _aZDB-2-SMA | ||
| 999 |
_c92419 _d92419 |
||