Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Covering Walks in Graphs
.
Bookmark this Record
Catalogue Record 29526
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 29526
.
Reviews
Catalogue Record 29526
.
British Library
Resolver for RSN-29526
Google Scholar
Resolver for RSN-29526
WorldCat
Resolver for RSN-29526
Catalogo Nazionale SBN
Resolver for RSN-29526
GoogleBooks
Resolver for RSN-29526
ICTP Library
Resolver for RSN-29526
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
511.5
Title
Covering Walks in Graphs ([Ebook]) / by Futaba Fujie, Ping Zhang.
Author
Fujie, Futaba
Added Personal Name
Zhang, Ping
Other name(s)
SpringerLink (Online service)
Publication
New York, NY : Springer, 2014.
Physical Details
XIV, 110 pages,. 37 illus., 11 illus. in color. : online resource.
ISBN
9781493903054
Summary Note
Covering 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.:
Contents note
1. Eulerian Walks -- 2. Hamiltonian Walks -- 3. Traceable Walks -- References -- Index. .
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-1-4939-0305-4
Links to Related Works
Subject References:
Applications of Mathematics
.
Combinatorics
.
Graph Theory
.
Mathematics
.
Authors:
author
.
Fujie, Futaba
.
Zhang, Ping
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
SpringerBriefs in Mathematics
.
Classification:
511.5
.
511.5 (DDC 23)
.
.
ISBD Display
Catalogue Record 29526
.
Tag Display
Catalogue Record 29526
.
Related Works
Catalogue Record 29526
.
Marc XML
Catalogue Record 29526
.
Add Title to Basket
Catalogue Record 29526
.
Catalogue Information 29526
Beginning of record
.
Catalogue Information 29526
Top of page
.
Download Title
Catalogue Record 29526
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
29526
1
29526
-
2
29526
-
3
29526
-
4
29526
-
5
29526
-
Quick Search
Search for