Graph theory
By: [by] J.A. Bondy [and], U.S.R. Murty
Contributors: Murty, U. S. R.
Series: Graduate texts in mathematics -- 244; Graduate texts in mathematics -- 244.
Publisher: Springer
Published: 2010
Place of publication: New York
Language: eng
Number of pages: 651
ISBN-13: 9781849966900
Subjects: Graph theory
Description: "Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics--computer science, combinatorial optimization, and operations research in particular--but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance. The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises--of varying levels of difficulty--are provided to help the reader master the techniques and reinforce their grasp of the material. A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters"--Cover.
Notes: Includes bibliographical references (p. 593-622) and index.
Table of contents: title: Graphs; title: Subgraphs; title: Connected graphs; title: Trees; title: Nonseparable graphs; title: Tree-search algorithms; title: Flows in networks; title: Complexity of algorithms; title: Connectivity; title: Planar graphs; title: The four-colour problem; title: Stable sets and cliques; title: The probabilistic method; title: Vertex colourings; title: Colourings of maps; title: Matchings; title: Edge colourings; title: Hamilton cycles; title: Coverings and packings in directed graphs; title: Electrical networks; title: Integer flows and coverings; title: Unsolved problems.