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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 26,02 expédition depuis Canada vers France
Destinations, frais et délaisEUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : BMV Bloor, Toronto, ON, Canada
Etat : Very Good. Used - Very Good. N° de réf. du vendeur 45-a- 00028
Quantité disponible : 1 disponible(s)
Vendeur : Buchpark, Trebbin, Allemagne
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 124 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 24473679/2
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. a|Provides a comprehensive treatment on measures of Hamiltonicity and traversability in graphsContains intriguing open problems and conjectures on spanning walks in graphsDescribes new frame works for several well-known Hamiltonian concepts. N° de réf. du vendeur 4213757
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781493903047_new
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 124 pp. Englisch. N° de réf. du vendeur 9781493903047
Quantité disponible : 2 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9781493903047
Quantité disponible : 10 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9781493903047
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. Neuware -CoveringWalks 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 authorsprovide 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 124 pp. Englisch. N° de réf. du vendeur 9781493903047
Quantité disponible : 2 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 280. N° de réf. du vendeur C9781493903047
Quantité disponible : Plus de 20 disponibles
Vendeur : Second Story Books, ABAA, Rockville, MD, Etats-Unis
Softcover. Octavo, 110 pages. In Very Good minus condition. Gray and blue spine with white text. Covers have mild shelf wear and slight bending to corners. Textblock clean. Shelved ND-E. 1377325. FP New Rockville Stock. N° de réf. du vendeur 1377325
Quantité disponible : 1 disponible(s)