Зарегистрироваться
Восстановить пароль
FAQ по входу

Bondy A., Murty U.S.R. Graph Theory

  • Файл формата pdf
  • размером 4,70 МБ
  • Добавлен пользователем
  • Отредактирован
Bondy A., Murty U.S.R. Graph Theory
Издательство Springer, 2008, -655 pp.
The present project began with the intention of simply making minor revisions to our earlier book. However, we soon came to the realization that the changing face of the subject called for a total reorganization and enhancement of its contents. As with Graph Theory with Applications, our primary aim here 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. For pedagogical reasons, we have concentrated on topics which can be covered satisfactorily in a course. The most conspicuous omission is the theory of graph minors, which we only touch upon, it being too complex to be accorded an adequate treatment. We have maintained as far as possible the terminology and notation of our earlier book, which are now generally accepted.
Particular care has been taken to provide a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. Many of these are to be found in insets, whereas others, such as search trees, network flows, the regularity lemma and the local lemma, are the topics of entire sections or chapters. The exercises, of varying levels of difficulty, have been designed so as to help the reader master these techniques and to reinforce his or her grasp of the material. Those exercises which are needed for an understanding of the text are indicated by a star. The more challenging exercises are separated from the easier ones by a dividing line. A second objective of the book 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. These and many more are listed in an appendix.
Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory may be based on the first few sections of selected chapters. Like number theory, graph theory is conceptually simple, yet gives rise to challenging unsolved problems. Like geometry, it is visually pleasing. These two aspects, along with its diverse applications, make graph theory an ideal subject for inclusion in mathematical curricula.
We have sought to convey the aesthetic appeal of graph theory by illustrating the text with many interesting graphs — a full list can be found in the index. The cover design, taken from Chapter 10, depicts simultaneous embeddings on the projective plane of K6 and its dual, the Petersen graph.
A Web page for the book is available at http://blogs.springer.com/bondyandmurty The reader will find there hints to selected exercises, background to open problems, other supplementary material, and an inevitable list of errata. For instructors wishing to use the book as the basis for a course, suggestions are provided as to an appropriate selection of topics, depending on the intended audience.
Graphs
Subgraphs
Connected Graphs
Trees
Nonseparable Graphs
Tree-Search Algorithms
Flows in Networks
Complexity of Algorithms
Connectivity
Planar Graphs
The Four-Colour Problem
Stable Sets and Cliques
The Probabilistic Method
Vertex Colourings
Colourings of Maps
Matchings
Edge Colourings
Hamilton Cycles
Coverings and Packings in Directed Graphs
Electrical Networks
Integer Flows and Coverings
Unsolved Problems
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация