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.

nexusstc/Introduction to Graph Theory/b15ae07760d387b0ad784a9fcf25d309.pdf

lgli/Introduction to Graph Theory (5th Edition) - Robin J. Wilson.pdf

lgrsnf/Introduction to Graph Theory (5th Edition) - Robin J. Wilson.pdf

zlib/Mathematics/Robin J. Wilson/Introduction to Graph Theory_3418010.pdf

Introduction to Graph Theory (5th Edition)

Введение в теорию графов

Робин Уилсон; перевод с английского и редакция И. В. Красикова

Wilson, Robin J.

Уилсон, Робин Дж

Pearson Education Limited

Диалектика

Longman

United Kingdom and Ireland, United Kingdom

Москва, Санкт-Петербург, Russia, 2019

Pearson Education (UK), Harlow, 2015

0

lg2176686

producers:
Adobe Acrobat 10.1.16 Image Conversion Plug-in

{"edition":"5","isbns":["027372889X","9780273728894"],"last_page":184,"publisher":"Pearson"}

Includes bibliographical references and index.

Предм. указ.: с. 236-239
Библиогр.: с. 215-217
Пер.: Wilson, Robin J. Introduction to graf theory 5th ed. Harlow [etc.]: Pearson 978-0-273-72889-4

РГБ

Russian State Library [rgb] MARC:
=001 010151593
=005 20191121150056.0
=008 191111s2019\\\\ru\\\\\\\\\\\\000\|\rus|d
=017 \\ $a КН-П-19-085110 $b RuMoRKP
=020 \\ $a 978-5-907144-75-0 $c 500 экз.
=040 \\ $a RuMoRGB $b rus $e rcr
=041 1\ $a rus $h eng
=044 \\ $a ru
=084 \\ $a В182.1я9 $2 rubbk
=100 1\ $a Уилсон, Робин Дж.
=245 00 $a Введение в теорию графов $c Робин Уилсон ; перевод с английского и редакция И. В. Красикова
=260 \\ $a Москва ; $a Санкт-Петербург $b Диалектика $c 2019
=300 \\ $a 239 с. $b ил., табл. $c 24 см
=336 \\ $a Текст (визуальный)
=337 \\ $a непосредственный
=500 \\ $a Предм. указ.: с. 236-239
=504 \\ $a Библиогр.: с. 215-217
=534 \\ $p Пер.: $a Wilson, Robin J. $t Introduction to graf theory $b 5th ed. $c Harlow [etc.]: Pearson $z 978-0-273-72889-4
=650 \7 $a Физико-математические науки -- Математика -- Геометрия и топология -- Топология -- Топология первых трех измерений. Узлы. Графы -- Популярные издания $2 rubbk
=852 \\ $a РГБ $b FB $j 2 19-65/259 $x 90
=852 7\ $a РГБ $b CZ2 $h В17/У36 $x 83
=852 \\ $a РГБ $b ORF $x 82

<p><b>Introduction to Graph Theory</b></p><p>5th edition</p><p><i>‘An excellent introduction on an increasingly popular topic’</i></p><p>G. Jones, University of Southampton</p><p><i>'If this book did not exist, it would be necessary to invent it!'</i></p><p>B. Cooper, University of Leeds</p><p><i>'I have always regarded Wilson's book as THE undergraduate textbook on graph theory, without a rival'</i></p><p>D. Sharpe, University of Sheffield</p><p>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.</p><p>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.</p><p>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.</p><p><b>Robin Wilson</b> 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.</p>

Mathematics
Cover 1
Contents 6
Preface 8
Introduction 10
Chapter 1 - Definitions and Examples 17
1.1 - Definitions 17
1.2 - Examples 27
1.3 - Variations on a theme 31
1.4 - Three puzzles 35
Chapter 2 - Paths and Cycles 41
2.1 - Connectivity 41
2.2 - Eulerian graphs and digraphs 49
2.3 - Hamiltonian graphs and digraphs 56
2.4 - Applications 61
Chapter 3 - Trees 70
3.1 - Properties of trees 70
3.2 - Counting trees 74
3.3 - More applications 79
Chapter 4 - Planarity 89
4.1 - Planar graphs 89
4.2 - Euler's formula 95
4.3 - Dual graphs 100
4.4 - Graphs on other surfaces 105
Chapter 5 - Colouring Graphs 110
5.1 - Colouring vertices 110
5.2 - Chromatic polynomials 116
5.3 - Colouring maps 120
5.4 - The four-color theorem 126
5.5 - Colouring edges 131
Chapter 6 - Matching, Marriage, and Menger's Theorem 137
6.1 - Hall's 'marriage' theorem 137
6.2 - Menger's theorem 143
6.3 - Network flows 147
Chapter 7 - Matroids 154
7.1 - Introduction to matroids 154
7.2 - Examples of matroids 158
7.3 - Matroids and graphs 161
Appendices 167
Appendix 1: Algorithms 167
Appendix 2: Table of numbers 170
List of symbols 171
Bibliography 172
Solutions to Selected Exercises 175
Introduction 175
Chapter 1 175
Chapter 2 178
Chapter 3 180
Chapter 4 182
Chapter 5 184
Chapter 6 186
Chapter 7 188
Index 190

Table of Contents
Introduction
Definitions and examples
Paths and cycles
Trees
Planarity
Colouring graphs
Matching, marriage and Menger's theorem
Matroids
Appendix 1: Algorithms
Appendix 2: Table of numbers
List of symbols
Bibliography
Solutions to selected exercises
Index

2018-02-02