Topics in Algorithmic Graph Theory

This book presents fifteen carefully edited expository chapters in the rapidly expanding area of algorithmic graph theory.

Lowell W. Beineke (Edited by), Martin Charles Golumbic (Edited by), Robin J. Wilson (Edited by)

9781108492607, Cambridge University Press

Hardback, published 3 June 2021

364 pages
24.1 x 16.2 x 2.5 cm, 0.68 kg

Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.

Foreword Martin Charles Golumbic
Preface Lowell W. Beineke and Robin J. Wilson
Preliminaries Lowell W. Beineke, Martin Charles Golumbic and Robin J. Wilson
1. Graph Algorithms Martin Charles Golumbic
2. Graph Colouring Variations Alain Hertz and Bernard Ries
3. Total Colouring Celina M. H. de Figueiredo
4. Testing of Graph Properties Ilan Newman
5. Cliques, Colouring and Satisfiability: From Structure to Algorithms Vadim Lozin
6. Chordal Graphs Martin Charles Golumbic
7. Dually and Strongly Chordal Graphs Andreas Brandstädt and Martin Charles Golumbic
8. Leaf Powers Christian Rosenke, Van Bang Le and Andreas Brandstädt
9. Split Graphs Karen L. Collins and Ann N. Trenk
10. Strong Cliques and Stable Sets Martin Milani?
11. Restricted Matchings Maximilian Fürst and Dieter Rautenbach
12. Covering Geometric Domains Gila Morgenstern
13. Graph Homomorphisms Pavol Hell and Jaroslav Nešet?il
14. Sparsity and Model Theory Patrice Ossona de Mendez
15. Extremal Vertex-sets Serge Gaspers
Notes on Contributors
Index.

Subject Areas: Algorithms & data structures [UMB], Combinatorics & graph theory [PBV], Discrete mathematics [PBD]