Articles liés à Introduction to Graph Theory
L'édition de cet ISBN n'est malheureusement plus disponible.
Synopsis
Please Read Notes: Brand New, International Softcover Edition, Printed in black and white pages, minor self wear on the cover or pages, Sale restriction may be printed on the book, but Book name, contents, and author are exactly same as Hardcover Edition. Fast delivery through DHL/FedEx express.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Quatrième de couverture
Introduction to Graph Theory
5th edition
‘An excellent introduction on an increasingly popular topic’
G. Jones, University of Southampton
'If this book did not exist, it would be necessary to invent it!'
B. Cooper, University of Leeds
'I have always regarded Wilson's book as THE undergraduate textbook on graph theory, without a rival'
D. Sharpe, University of Sheffield
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.
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.
Robin Wilson is Emeritus Professor of Pure Mathematics at the Open University, and Emeritus Professor of Geometry at Gresham College, London. He is also a former Fellow in Mathematics at Keble College, Oxford University, and now teaches at Pembroke College. He has written and edited almost 40 books on graph theory, combinatorics, the history of mathematics, and music, and is very involved with the communication and popularisation of mathematics.
Présentation de l'éditeur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurWILSON
- Date d'édition2007
- ISBN 10 8131706982
- ISBN 13 9788131706985
- ReliureBroché
- Langueanglais
(Aucun exemplaire disponible)
Chercher: Créez une demandeVous ne trouvez pas le livre que vous recherchez ? Nous allons poursuivre vos recherches. Si l'un de nos libraires l'ajoute aux offres sur AbeBooks, nous vous le ferons savoir !
Créez une demande
