ABSTRACT
In Chapter 4, we focused on the underlying structure of a graph in terms of its connectivity. In this chapter we again focus on the structure of the graph but from the viewpoint of grouping vertices based on a variety of criteria, mainly in terms of making viable pairings. In the next chapter, we will again group vertices (or edges) together in order to avoid conflict. To begin this chapter, we investigate the optimization of pairings through the use of edge-matchings within a graph, more commonly known as a matching.
