Book contents
- Frontmatter
- Contents
- Foreword
- Preface
- Preliminaries
- 1 Graph algorithms
- 2 Graph colouring variations
- 3 Total colouring
- 4 Testing of graph properties
- 5 Cliques, colouring and satisfiability: from structure to algorithms
- 6 Chordal graphs
- 7 Dually and strongly chordal graphs
- 8 Leaf powers
- 9 Split graphs
- 10 Strong cliques and stable sets
- 11 Restricted matchings
- 12 Covering geometric domains
- 13 Graph homomorphisms
- 14 Sparsity and model theory
- 15 Extremal vertex-sets
- Notes on contributors
- Index
12 - Covering geometric domains
Published online by Cambridge University Press: 13 May 2021
- Frontmatter
- Contents
- Foreword
- Preface
- Preliminaries
- 1 Graph algorithms
- 2 Graph colouring variations
- 3 Total colouring
- 4 Testing of graph properties
- 5 Cliques, colouring and satisfiability: from structure to algorithms
- 6 Chordal graphs
- 7 Dually and strongly chordal graphs
- 8 Leaf powers
- 9 Split graphs
- 10 Strong cliques and stable sets
- 11 Restricted matchings
- 12 Covering geometric domains
- 13 Graph homomorphisms
- 14 Sparsity and model theory
- 15 Extremal vertex-sets
- Notes on contributors
- Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781108592376/resource/name/firstPage-9781108492607c12_246-261.jpg)
- Type
- Chapter
- Information
- Topics in Algorithmic Graph Theory , pp. 246 - 261Publisher: Cambridge University PressPrint publication year: 2021