International Edition. Very fast shipping. Receive your book in 2-7 business days if you checkout with expedited shipping. We take pride in our customer service, please contact us if you have any questions regarding the listing. Bookseller Inventory #
This book fills a need for a thorough introduction to graph theory that features both the understanding and writing of proofs about graphs. Verification that algorithms work is emphasized more than their complexity. An effective use of examples, and huge number of interesting exercises, demonstrate the topics of trees and distance, matchings and factors, connectivity and paths, graph coloring, edges and cycles, and planar graphs. For those who need to learn to make coherent arguments in the fields of mathematics and computer science.
Excerpt. © Reprinted by permission. All rights reserved.:
Graph theory is a delightful playground for the exploration of proof techniques in discrete mathematics, and its results have applications in many areas of the computing, social, and natural sciences. The design of this book permits usage in a one-semester introduction at the undergraduate or beginning graduate level, or in a patient two-semester introduction. No previous knowledge of graph theory is assumed. Many algorithms and applications are included, but the focus is on understanding the structure of graphs and the techniques used to analyze problems in graph theory.
Many textbooks have been written about graph theory. Due to its emphasis on both proofs and applications, the initial model for this book was the elegant text by J.A. Bondy and US.R. Murty, Graph Theory with Applications (Macmillan/NorthHolland 1976). Graph theory is still young, and no consensus has emerged on how the introductory material should be presented. Selection and order of topics, choice of proofs, objectives, and underlying themes are matters of lively debate. Revising this book dozens of times has taught me the difficulty of these decisions. This book is my contribution to the debate.
The Second Edition
The revision for the second edition emphasizes making the text easier for the students to learn from and easier for the instructor to teach from. There have not been great changes in the overall content of the book, but the presentation has been modified to make the material more accessible, especially in the early parts of the book. Some of the changes are discussed in more detail later in this preface; here I provide a brief summary.
Various features of this book facilitate students' efforts to understand the material. There is discussion of proof techniques, more than 1200 exercises of varying difficulty, more than 400 illustrations, and many examples. Proofs are presented in full in the text.
Many undergraduates begin a course in graph theory with little exposure to proof techniques. Appendix A provides background reading that will help them get started. Students who have difficulty understanding or writing proofs in the early material should be encouraged to read this appendix in conjunction with Chapter 1. Some discussion of proof techniques still appears in the early sections of the text (especially concerning induction), but an expanded treatment of the basic background (especially concerning sets, functions, relations, and elementary counting) is now in Appendix A.
Most of the exercises require proofs. Many undergraduates have had little practice at presenting explanations, and this hinders their appreciation of graph theory and other mathematics. The intellectual discipline of justifying an argument is valuable independently of mathematics; I hope that students will appreciate this. In writing solutions to exercises, students should be careful in their use of language ("say what you mean"), and they should be intellectually honest ("mean what you say").
Although many terms in graph theory suggest their definitions, the quantity of terminology remains an obstacle to fluency. Mathematicians like to gather definitions at the start, but most students succeed better if they use a concept before receiving the next. This, plus experience and requests from reviewers, has led me to postpone many definitions until they are needed. For example, the definition of cartesian product appears in Section 5.1 with coloring problems. Line graphs are defined in Section 4.2 with Menger's Theorem and in Section 7.1 with edge-coloring. The definitions of induced subgraph and join have now been postponed to Section 1.2 and Section 3.1, respectively.
I have changed the treatment of digraphs substantially by postponing their introduction to Section 1.4. Introducing digraphs at the same time as graphs tends to confuse or overwhelm 'students. Waiting to the end of Chapter 1 allows them to become comfortable with basic concepts in the context of a single model. The discussion of digraphs then reinforces some of those concepts while clarifying the distinctions. The two models are still discussed together in the material on connectivity.
This book contains more material than most introductory texts in graph theory. Collecting the advanced material as a final optional chapter of "additional topics" permits usage at different levels. The undergraduate introduction consists of the first seven chapters (omitting most optional material), leaving Chapter 8 as topical reading for interested students. A graduate course can treat most of Chapters 1 and 2 as recommended reading, moving rapidly to Chapter 3 in class and reaching some topics in Chapter 8. Chapter 8 can also be used as the basis for a second course in graph theory, along with material that was optional in earlier chapters.
Many results in graph theory have several proofs; illustrating this can increase students' flexibility in trying multiple approaches to a problem. I include some alternative proofs as remarks and others as exercises.
Many exercises have hints, some given with the exercise statement and others in Appendix C. Exercises marked "(-)" or "(+)" are easier or more difficult, respectively, than unmarked problems. Those marked "(+)" should not be assigned as homework in a typical undergraduate course. Exercises marked "(!)" are especially valuable, instructive, or entertaining. Those marked "(*)" use material labeled optional in the text.
Each exercise section begins with a set of "(-)" exercises, ordered according to the material in the section and ending with a line of bullets. These exercises either check understanding of concepts or are immediate applications of results in the section. I recommend some of these to my class as "warmup" exercises to check their understanding before working the main homework problems, most of which are marked "(!)". Most problems marked "(-)" are good exam questions. When using other exercises on exams, it may be a good idea to provide hints from Appendix C.
Exercises that relate several concepts appear when the last is introduced. Many pointers to exercises appear in the text where relevant concepts are discussed. An exercise in the current section is cited by giving only its item number among the exercises of that section. Other cross-references are by Chapter. Section. Item.
Organization and Modification
In the first edition, I sought a development that was intellectually coherent and displayed a gradual (not monotonic) increase in difficulty of proofs and in algorithmic complexity.
Carrying this further in the second edition, Eulerian circuits and Hamiltonian cycles are now even farther apart. The simple characterization of Eulerian circuits is now in Section 1.2 with material closely related to it. The remainder of the former Section 2.4 has been dispersed to relevant locations in other sections, with Fleury's Algorithm dropped.
Chapter 1 has been substantially rewritten. I continue to avoid the term "multigraph"; it causes more trouble than it resolves, because many students assume that a multigraph must have multiple edges. It is less distracting to append the word "simple" where needed and keep "graph" as the general object, with occasional statements that in particular contexts it makes sense to consider only simple graphs.
The treatment of definitions in Chapter 1 has been made more friendly and precise, particularly those involving paths, trails, and walks. The informal groupings of basic definitions in Section 1.1 have been replaced by Definition items that help students find definitions more easily.
In addition to the material on isomorphism, Section 1.1 now has a more precise treatment of the Petersen graph and an explicit introduction of the notions of decomposition and girth. This provides language that facilitates later discussion in various places, and it permits interesting explicit questions other than isomorphism.
Sections 1.2-1.4 have become more coherent. The treatment of Eulerian circuits motivates and completes Section 1.2. Some material has been removed from Section 1.3 to narrow its focus to degrees and counting, and this section has acquired the material on vertex degrees that had been in Section 1.4. Section 1.4 now provides the introduction to digraphs and can be treated lightly.
Trees and distance appear together in Chapter 2 due to the many relations between these topics. Many exercises combine these notions, and algorithms to compute distances produce or use trees.
Most graph theorists agree that the König-Egerváry Theorem deserves an independent proof without network flow. Also, students have trouble distinguishing "k-connected" from "connectivity k", which have the same relationship as "k-colorable" and "chromatic number k". I therefore treat matching first and later use matching to prove Menger's Theorem. Both matching and connectivity are used in the coloring material.
In response to requests from a number of users, I have added a short optional subsection on dominating sets at the end of Section 3.1. The material on weighted bipartite matching has been clarified by emphasis on vertex cover instead of augmenting path and by better use of examples.
Turán's Theorem uses only elementary ideas about vertex degrees and induction and hence appeared in Chapter 1 in the first edition. This caused some difficulties, because it was the most abstract item up to that point and students felt somewhat overwhelmed by it. Thus I have kept the simple triangle-free case (Mantel's Theorem) in Section 1.3 and have moved the full theorem to Section 5.2 under the viewpoint of extremal problems related to coloring.
The chapter on planarity now comes before that on "Edges and Cycles". When an instructor is short of time, planarity is more important to reach than the material on edge-coloring and Hamiltonian cycles. The questions involved in planarity appeal intuitively to students due to their visual aspects, and many students have encountered these questions before. Also, the ideas involved in discussing planar graphs seem more intellectually broadening in relation to the earlier material of the course than the ideas used to prove the basic results on edge-coloring and Hamiltonian cycles.
Finally, discussing planarity first makes the material of Chapter 7 more coherent. The new arrangement permits a more thorough discussion of the relationships among planarity, edge-coloring, and Hamiltonian cycles, leading naturally beyond the Four Color Theorem to the optional new material on nowhere-zero flows as a dual concept to coloring.
When students discover that the coloring and Hamiltonian cycle problems lack good algorithms, many become curious about NP-completeness. Appendix B satisfies this curiosity. Presentation of NP-completeness via formal languages can be technically abstract, so some students appreciate a presentation in the context of graph problems. NP-completeness proofs also illustrate the variety and usefulness of "graph transformation" arguments.
The text explores relationships among fundamental results. Petersen's Theorem on 2-factors (Chapter 3) uses Eulerian circuits and bipartite matching. The equivalence between Menger's Theorem and the Max Flow-Min Cut Theorem is explored more fully than in the first edition, and the "Baseball Elimination" application is now treated in more depth. The k — 1-connectedness of k-color-critical graphs (Chapter 5) uses bipartite matching. Section 5.3 offers a brief introduction to perfect graphs, emphasizing chordal graphs. Additional features of this text in comparison to some others include the algorithmic proof of Vizing's Theorem and the proof of Kuratowski's Theorem by Thomassen's methods.
There are various other additions and improvements in the first seven chapters. There is now a brief discussion of Heawood's Formula and the Robertson-Seymour Theorem at the end of Chapter 6. In Section 7.1, a proof of Shannon's bound on the edge-chromatic number has been added. In Section 5.3, the characterization of chordal graphs is somewhat simpler than before by proving a stronger result about simplicial vertices. In Section 6.3, the proof of the reducibility of the Birkhoff diamond has been eliminated, but a brief discussion of discharging has been added. The material discussing issues in the proof of the theorem is optional, and the aim is to give the flavor of the approach without getting into detailed arguments. From this viewpoint the reducibility proof seemed out of focus.
Chapter 8 contains highlights of advanced material and is not intended for an undergraduate course. It assumes more sophistication than earlier chapters and is written more tersely. Its sections are independent; each selects appealing results from a large topic that merits a chapter of its own. Some of these sections become more difficult near the end; an instructor may prefer to sample early material in several sections rather than present one completely.
There may be occasional relationships between items in Chapter 8 and items marked optional in the first seven chapters, but generally cross-references indicate the connections. The material of Chapter 8 has not changed substantially since the first edition, although many corrections have been made and the presentation has been clarified in many places.
I will treat advanced graph theory more thoroughly in The Art of Combinatoracs. Volume I is devoted to extremal graph theory and Volume II to structure of graphs. Volume III has chapters on matroids and integer programming (including network flow). Volume IV emphasizes methods in combinatorics and discusses ...
Title: Introduction to Graph Theory (2nd Edition)
Book Description Condition: New. Brand new book. This is an international edition textbook with identical content as the US version. We ship all our orders from CA/IL, USA (depending on your address) and NOT from Asia! Choose expedited shipping for superfast delivery with tracking. Seller Inventory # 9780130144003
Book Description Softcover. Condition: New. 2nd edition. Brand NEW, Paperback International Edition. Black & White or color, Cover and ISBN may be different but similar contents as US editions. Standard delivery takes 5-9 business days by USPS/DHL with tracking number. Choose expedited shipping for superfast delivery 3-5 business days by UPS/DHL/FEDEX. We also ship to PO Box addresses but by Standard delivery and shipping charges will be extra. International Edition Textbooks may bear a label -Not for sale in the U.S. or Canada- etc. printed only to discourage U.S. students from obtaining an affordable copy. Legal to use despite any disclaimer on cover as per US court. No access code or CD included unless specified. In some instances, the international textbooks may have different exercises at the end of the chapters. Printed in English. We may ship the books from multiple warehouses across the globe, including India depending upon the availability of inventory storage. In case of orders from Europe, custom charges may comply by the relevant government authority and we are not liable for it. 100% Customer satisfaction guaranteed! Please feel free to contact us for any queries. Seller Inventory # LPBDUS128089
Book Description Paperback. Condition: NEW. This is an International Edition. Brand New Paperback- Same Title Author and Edition as listed. ISBN and Cover design differs. Similar Contents as U.S Edition. Delivery within 3-7 business days ACROSS THE GLOBE. We can ship to PO Box address in US. International Edition Textbooks may bear a label "Not for sale in the U.S. or Canada" or "For sale in Asia only" or similar restrictions- printed only to discourage students from obtaining an affordable copy. US Court has asserted your right to buy and use International edition. Access code/CD may not provided with these editions. We may ship the books from multiple warehouses across the globe including Asia depending upon the availability of inventory. Printed in English. Customer satisfaction guaranteed. Choose expedited shipping for Express delivery. Tracking number provided for every order. Seller Inventory # RU_9780130144003
Book Description Pearson. Condition: New. 0130144002 This is an International Edition. Brand New, Paperback, Delivery within 6-14 business days, Similar Contents as U.S Edition, ISBN and Cover design may differ, printed in Black & White. Choose Expedited shipping for delivery within 3-8 business days. We do not ship to PO Box, APO , FPO Address. In some instances, subjects such as Management, Accounting, Finance may have different end chapter case studies and exercises. International Edition Textbooks may bear a label "Not for sale in the U.S. or Canada" and "Content may different from U.S. Edition" - printed only to discourage U.S. students from obtaining an affordable copy. The U.S. Supreme Court has asserted your right to purchase international editions, and ruled on this issue. Access code/CD is not provided with these editions , unless specified. We may ship the books from multiple warehouses across the globe, including India depending upon the availability of inventory storage. Customer satisfaction guaranteed. Seller Inventory # AU_9780130144003
Book Description Pearson. Hardcover. Condition: New. 0130144002 New ,International Edition , Paperback , Same text as US edition , ISBN /Cover may be different , Ready to ship, Express 5-8 business days worldwide delivery. Seller Inventory # INSTFHR32325
Book Description Soft cover. Condition: New. Opt EXPEDITED shipping for 2 to 4 day delivery - Brand NEW - International Edition - 2ed - SAME Contents as in US edition - SHRINKwrapped BOXpacked - There is no CD or Access Code, unless specified above - Ships from various locations. Seller Inventory # B24
Book Description Pearson. Hardcover. Condition: New. 0130144002 Paperback. Book Condition: New. This is an International Edition. Brand new. Seller Inventory # INDMKT-9789332549654
Book Description Pearson. Hardcover. Condition: New. 0130144002 New ,International Edition , Paperback , Same text as US edition , ISBN /Cover may be different , Ready to ship, Express 5-8 business days worldwide delivery. Seller Inventory # INFHR486
Book Description Pearson. Paperback. Condition: New. International Edition. Very fast shipping. Receive your book in 2-7 business days if you checkout with expedited shipping. We take pride in our customer service, please contact us if you have any questions regarding the listing. Seller Inventory # in-us-9780130144003
Book Description Pearson. Paperback. Condition: Good. International Edition. Very fast shipping. Receive your book in 2-7 business days if you checkout with expedited shipping. We take pride in our customer service, please contact us if you have any questions regarding the listing. Seller Inventory # iu-us-9780130144003