ABSTRACT
There are numerous problems concerning graphs that contain sets of edges or sets of vertices possessing a property of particular interest. Often we are interested in partitioning the edge set or vertex set of a graph into subsets so that each subset possesses this property. In this chapter, we describe some of the best-known examples of such sets and the subgraphs they induce.
