Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
Please make all selections above before adding to cart
Copy To Clipboard
Successfully Copied!
The Game of Cops and Robbers on Graphs

Anthony Bonato Ryerson University, Toronto, ON, Canada
Richard J. Nowakowski Dalhousie University, Halifax, NS, Canada
Available Formats:
Softcover ISBN: 978-0-8218-5347-4
Product Code: STML/61
List Price: $51.00 Individual Price:$40.80
Electronic ISBN: 978-1-4704-1656-0
Product Code: STML/61.E
List Price: $48.00 Individual Price:$38.40
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $76.50 Click above image for expanded view The Game of Cops and Robbers on Graphs Anthony Bonato Ryerson University, Toronto, ON, Canada Richard J. Nowakowski Dalhousie University, Halifax, NS, Canada Available Formats:  Softcover ISBN: 978-0-8218-5347-4 Product Code: STML/61  List Price:$51.00 Individual Price: $40.80  Electronic ISBN: 978-1-4704-1656-0 Product Code: STML/61.E  List Price:$48.00 Individual Price: $38.40 Bundle Print and Electronic Formats and Save! This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.  List Price:$76.50
• Book Details

Student Mathematical Library
Volume: 612011; 276 pp
MSC: Primary 05; 91;

This book is the first and only one of its kind on the topic of Cops and Robbers games, and more generally, on the field of vertex pursuit games on graphs. The book is written in a lively and highly readable fashion, which should appeal to both senior undergraduates and experts in the field (and everyone in between). One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games. Several recent and new results are discussed, along with a comprehensive set of references. The book is suitable for self-study or as a textbook, owing in part to the over 200 exercises. The reader will gain insight into all the main directions of research in the field and will be exposed to a number of open problems.

Undergraduate, graduate students, and research mathematicians interested in networks and graph theory.

• Chapters
• Chapter 1. Introduction
• Chapter 2. Characterizations
• Chapter 3. Meyniel’s conjecture
• Chapter 4. Graph products and classes
• Chapter 5. Algorithms
• Chapter 6. Random graphs
• Chapter 7. Infinite graphs
• Chapter 8. Variants of Cops and Robbers
• Chapter 9. Good guys versus bad guys

• Reviews

• The authors do a wonderful job of keeping the exposition lively and engaging, while still covering some deep mathematics and introducing some fascinating ideas. The technical background required to read this book is relatively low, and the authors do a good job of introducing the relevant background as needed. For these reasons, as well as the fact that the subject is itself engaging, this is a book that I would happily hand to an undergraduate math major for an independent study, capstone project, or even just to read for fun! But it is also a book that I think any mathematician could pick up and quickly learn something new and interesting. And I cannot think of a higher compliment to give than that.

Darren Glass, MAA Online
• This is a textbook that presents the state of the art in the literature on Cops and Robbers games and, more generally, vertex pursuit games on graphs.

Giacomo Bonanno, Zentralblatt MATH
• [This] book is well written, informative, and fun to read. It easily meets the goals of surveying the main directions in the area, and of providing a tool through which one could learn about games and graphs. Thus, it is useful both as an introduction and a reference.

Gary MacGillivray, MathSciNet
• Requests

Review Copy – for reviewers who would like to review an AMS book
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Volume: 612011; 276 pp
MSC: Primary 05; 91;

This book is the first and only one of its kind on the topic of Cops and Robbers games, and more generally, on the field of vertex pursuit games on graphs. The book is written in a lively and highly readable fashion, which should appeal to both senior undergraduates and experts in the field (and everyone in between). One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games. Several recent and new results are discussed, along with a comprehensive set of references. The book is suitable for self-study or as a textbook, owing in part to the over 200 exercises. The reader will gain insight into all the main directions of research in the field and will be exposed to a number of open problems.

Undergraduate, graduate students, and research mathematicians interested in networks and graph theory.

• Chapters
• Chapter 1. Introduction
• Chapter 2. Characterizations
• Chapter 3. Meyniel’s conjecture
• Chapter 4. Graph products and classes
• Chapter 5. Algorithms
• Chapter 6. Random graphs
• Chapter 7. Infinite graphs
• Chapter 8. Variants of Cops and Robbers
• Chapter 9. Good guys versus bad guys
• The authors do a wonderful job of keeping the exposition lively and engaging, while still covering some deep mathematics and introducing some fascinating ideas. The technical background required to read this book is relatively low, and the authors do a good job of introducing the relevant background as needed. For these reasons, as well as the fact that the subject is itself engaging, this is a book that I would happily hand to an undergraduate math major for an independent study, capstone project, or even just to read for fun! But it is also a book that I think any mathematician could pick up and quickly learn something new and interesting. And I cannot think of a higher compliment to give than that.

Darren Glass, MAA Online
• This is a textbook that presents the state of the art in the literature on Cops and Robbers games and, more generally, vertex pursuit games on graphs.

Giacomo Bonanno, Zentralblatt MATH
• [This] book is well written, informative, and fun to read. It easily meets the goals of surveying the main directions in the area, and of providing a tool through which one could learn about games and graphs. Thus, it is useful both as an introduction and a reference.

Gary MacGillivray, MathSciNet
Review Copy – for reviewers who would like to review an AMS book
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
You may be interested in...
Please select which format for which you are requesting permissions.