1 Introduction

2 Hereditary Graph Classes

2.1 Classes Characterized by a Finite Number of Minimal Forbidden Subgraphs

2.2 Classes Characterized by an Infinite Number of Minimal Forbidden Subgraphs

2.3 Subexponential Time Algorithms

2.4 Related Results

3 Connectivity, Cuts, and Clustering

4 Degree Constraints