Question: Imagine that the diagram shown below is a map with countries labeled a-g. Is it possible to color the map with only three colors so that no two adjacent countries have the same color? To answer this question, draw and analyze a graph in which each country is represented by a vertex and two vertices are connected by an edge if, and only if, the countries share a common border
