5th edition. — Harlow: Pears, 2010. — 193 p.Description: In recent years graph theory has emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. Robin Wilson’s book has been widely used as a text for undergraduate courses in mathematics, computer science and economics, and as a readable introduction to the subject for non-mathematicians. The opening chapters provide a basic foundation course, containing definitions and examples, connectedness, Eulerian and Hamiltonian paths and cycles, and trees, with a range of applications. This is followed by two chapters on planar graphs and colouring, with special reference to the four-colour theorem. The next chapter deals with transversal theory and connectivity, with applications to network flows. A final chapter on matroid theory ties together material from earlier chapters, and an appendix discusses algorithms and their efficiency. Features: For this new edition the text has been revised throughout, and several sections have been reorganised and renumbered. Some new material has been added – notably on the proof of the four-colour theorem, the bracing of rectangular frameworks and algorithms – and the number of exercises has been increased and more solutions are provided. New to this Edition: New material on the proof of the four-colour theorem, the bracing of rectangular frameworks and algorithms. The number of exercises has been increased and more solutions are provided. Revised throughout, and several sections have been reorganised and renumbered.Contents:IntroductionDefinitions and examples Paths and cycles Trees Planarity Colouring graphs Matching, marriage and Menger's theorem MatroidsAppendix 1: AlgorithmsAppendix 2: Table of numbersList of symbolsBibliographySolutions to selected exercisesIndex
Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.