This repository contains java files of a graph colorability project. This graph colorability algorithm determines if a graph is two colorable or not, meaning, if a vertex can have a unique color amongst all of its adjacent vertexes. For example, if a vertex's color is BLUE than all of its adjacent vertexes must be RED. Graph colorability can be applied to a number of real world situations. In fact, graph coloring problems arise from the problem of coloring a map, where two countries or states must have different colors when they are adjacent.