Not every possible graph, just every "interesting" class of subgraph that can be extended or combined with others to obtain a coloring of any planar graph. Thes

Not every possible graph, just every "interesting" class of subgraph that can be extended or combined with others to obtain a coloring of any planar graph. These are a large but finite number; if a graph is planar it cannot have too many edges.