A Tour through Graph Theory: Textbooks in Mathematics
Autor Karin R. Saouben Limba Engleză Paperback – 11 iun 2026
The book introduces graph theory to students who are not mathematics majors. To distinguish itself from others covering the same topic, the book:
- Employs graph theory to teach mathematical reasoning
- Promotes critical thinking and problem solving
- Provides rich examples and clear explanations without using proofs
- Includes thoughtful discussions of historical problems and modern questions
This book is intended to strike a balance between focusing on the theory and exploration of proof techniques and the algorithmic aspect of graph theory. Explanations and logical reasoning for solutions, but no formal mathematical proofs, are provided. Each chapter includes problems to test understanding of the material and can be used for homework, quiz problems, or self-study.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 620.12 lei 6-8 săpt. | |
| CRC Press – 30 oct 2017 | 620.12 lei 6-8 săpt. | |
| CRC Press – 11 iun 2026 | 370.32 lei Precomandă | |
| Hardback (1) | 933.41 lei Precomandă | |
| CRC Press – 11 iun 2026 | 933.41 lei Precomandă |
Din seria Textbooks in Mathematics
-
Preț: 416.90 lei - 8%
Preț: 463.27 lei -
Preț: 416.33 lei - 8%
Preț: 405.62 lei - 9%
Preț: 698.81 lei - 8%
Preț: 443.60 lei -
Preț: 418.19 lei -
Preț: 418.19 lei -
Preț: 376.83 lei - 15%
Preț: 691.63 lei -
Preț: 397.25 lei -
Preț: 363.69 lei -
Preț: 446.04 lei -
Preț: 302.18 lei -
Preț: 419.19 lei -
Preț: 433.28 lei -
Preț: 424.82 lei - 9%
Preț: 1092.80 lei -
Preț: 438.95 lei -
Preț: 419.94 lei -
Preț: 403.87 lei - 8%
Preț: 461.16 lei - 9%
Preț: 735.67 lei - 8%
Preț: 436.25 lei -
Preț: 422.80 lei - 11%
Preț: 349.82 lei -
Preț: 388.87 lei - 8%
Preț: 434.43 lei - 8%
Preț: 614.00 lei -
Preț: 424.60 lei - 20%
Preț: 676.32 lei - 15%
Preț: 632.46 lei - 18%
Preț: 1040.91 lei - 15%
Preț: 487.88 lei - 15%
Preț: 671.18 lei - 18%
Preț: 758.46 lei - 15%
Preț: 620.12 lei - 25%
Preț: 511.13 lei - 18%
Preț: 758.23 lei - 15%
Preț: 554.84 lei - 18%
Preț: 716.76 lei - 18%
Preț: 822.09 lei - 15%
Preț: 680.80 lei - 18%
Preț: 921.37 lei - 15%
Preț: 689.10 lei
Preț: 370.32 lei
Preț vechi: 501.00 lei
-26% Precomandă
Puncte Express: 555
Preț estimativ în valută:
65.55€ • 76.42$ • 56.78£
65.55€ • 76.42$ • 56.78£
Carte nepublicată încă
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781032850818
ISBN-10: 1032850817
Pagini: 400
Ilustrații: 1300
Dimensiuni: 156 x 234 mm
Ediția:2. Auflage
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Textbooks in Mathematics
ISBN-10: 1032850817
Pagini: 400
Ilustrații: 1300
Dimensiuni: 156 x 234 mm
Ediția:2. Auflage
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Textbooks in Mathematics
Public țintă
Undergraduate CoreCuprins
Part 1: Graph Models and Routes 1. Eulerian Tours 2. Hamiltonian Cycles 3. Paths 4. Additional Topics in Graph Routes Part 2: Graph Structure 5. Trees and Networks 6. Matching 7. Graph Coloring 8. Additional Topics in Graph Structure
Notă biografică
Karin Saoub is the M. Paul Capp and Constance Whitehead Professor of Mathematics, and Dean of the School of Health, Science, and Sustainability at Roanoke College, Salem, Virginia. She received her Ph.D. in Mathematics from Arizona State University and a Bachelor of Arts from Wellesley College. Her research focuses on graph coloring and online algorithms applied to tolerance graphs. She is also the author of Graph Theory: An Introduction to Proofs, Algorithms, and Applications published by CRC Press.
Descriere
The book introduces graph theory to students who are not mathematics majors. New to this second edition, the author offers more explanation for concepts and more context for the topics. This book is intended to strike a balance between focusing on the theory and exploration of proof techniques and the algorithmic aspect of graph theory.
Recenzii
Graph theory has become a stand-alone subject long back due to its immense potential for solving real life problems with not much di□culty. This one aspect has attracted bright minds throughout the globe to pursue this subject vigorously. Saoub Karin is one such excellent mathematician with priceless writing skills, she decided to share her passion for the subject and she has come forward to throw her hat in the pool of graph theory textbooks. Her approach however is quite different from others in the sense that she wants to make her text book readable not only for sophomores but also for other non-mathematics major students. This book has enough material to be taught for one full semester even though not much weight is given for the rigorous proof of several wonderful results.
The organization of the text book is planned as tours within a graph (Chapters 1 to 3), structure within a graph (Chapters 4 to 6) and a few other topics (Chapter 7) for better and deep understanding of the concepts touched in the first two divisions.
In Chapter 1, that deals with Eulerian tours, basic concepts, definitions and standard results statements are covered with adequate examples from real life situations. Then standard algorithms like Fleury's, Hierholzer's are discussed with illustrations. The chapter ends with discussion on the Chinese postman problem and a number of problems exercise section that are numerical rather than theoretical in nature. A few project tasks are also given.
In Chapter 2, the author takes us along the study of Hamiltonian cycles. Notable inclusions are a brute force algorithm for the travelling salesman problem, both nearest and repetitive nearest neighbor algorithms, cheapest link algorithm, nearest insertion algorithm, asymmetric travelling salesman algorithm and undirecting algorithm. A number of interesting problems are available in exercise section.
In Chapter 3, paths are introduced and it starts with Dijkstra's algorithm for both undirected and directed graphs and sails through project scheduling and critical path algorithm and ends with adequate exercise problems.
In Chapter 4, trees and networks are introduced with explanation about Kruskal's algorithm, Prim's algorithm, Toricelli's construction, Steiner trees, and mTSP algorithm, along with the exercise section, Boruvka's algorithm is outlined in the projects section.
In Chapter 5, matching is covered while probing bipartite graphs, augmenting path algorithm, vertex cover method, Gale-Shapley algorithm for stable matching, matchings in non-bipartite graphs are some interesting topics covered with visual illustrations along with the exercise section and the projects section. A brief discussion on Christo des' algorithm is also found there.
In Chapter 6, graph coloring is given by starting with the four color problem, then coloring strategies, equitable coloring, online coloring, first-fit coloring algorithm are explained with examples. A brief study on perfect graphs, interval graphs, tolerance graphs and weighted coloring are made with simple examples. The chapter as usual ends with the exercise section and the project section.
In Chapter 7, the author provides us with a valuable exposure to additional topics such as complexity of algorithms, graph isomorphism, tournaments, ow and capacity, rooted trees, BFS tree, planarity, edge coloring and Ramsey number. All these topics are covered from non-mathematics major students' point of view, with simple but powerful visual representation.
At the end, solutions for selected exercise problems are given with brief hints. To conclude, the book really provides a wonderful learning experience. A positive aspect of this book is that most of the topics can be self learnt without teacher assistance.
V. Yegnanarayanan (Chennai)
The organization of the text book is planned as tours within a graph (Chapters 1 to 3), structure within a graph (Chapters 4 to 6) and a few other topics (Chapter 7) for better and deep understanding of the concepts touched in the first two divisions.
In Chapter 1, that deals with Eulerian tours, basic concepts, definitions and standard results statements are covered with adequate examples from real life situations. Then standard algorithms like Fleury's, Hierholzer's are discussed with illustrations. The chapter ends with discussion on the Chinese postman problem and a number of problems exercise section that are numerical rather than theoretical in nature. A few project tasks are also given.
In Chapter 2, the author takes us along the study of Hamiltonian cycles. Notable inclusions are a brute force algorithm for the travelling salesman problem, both nearest and repetitive nearest neighbor algorithms, cheapest link algorithm, nearest insertion algorithm, asymmetric travelling salesman algorithm and undirecting algorithm. A number of interesting problems are available in exercise section.
In Chapter 3, paths are introduced and it starts with Dijkstra's algorithm for both undirected and directed graphs and sails through project scheduling and critical path algorithm and ends with adequate exercise problems.
In Chapter 4, trees and networks are introduced with explanation about Kruskal's algorithm, Prim's algorithm, Toricelli's construction, Steiner trees, and mTSP algorithm, along with the exercise section, Boruvka's algorithm is outlined in the projects section.
In Chapter 5, matching is covered while probing bipartite graphs, augmenting path algorithm, vertex cover method, Gale-Shapley algorithm for stable matching, matchings in non-bipartite graphs are some interesting topics covered with visual illustrations along with the exercise section and the projects section. A brief discussion on Christo des' algorithm is also found there.
In Chapter 6, graph coloring is given by starting with the four color problem, then coloring strategies, equitable coloring, online coloring, first-fit coloring algorithm are explained with examples. A brief study on perfect graphs, interval graphs, tolerance graphs and weighted coloring are made with simple examples. The chapter as usual ends with the exercise section and the project section.
In Chapter 7, the author provides us with a valuable exposure to additional topics such as complexity of algorithms, graph isomorphism, tournaments, ow and capacity, rooted trees, BFS tree, planarity, edge coloring and Ramsey number. All these topics are covered from non-mathematics major students' point of view, with simple but powerful visual representation.
At the end, solutions for selected exercise problems are given with brief hints. To conclude, the book really provides a wonderful learning experience. A positive aspect of this book is that most of the topics can be self learnt without teacher assistance.
V. Yegnanarayanan (Chennai)