This program is an solution to the Graph Coloring problem using the concept of various mathematical theorems based on the concept of the Bipartite graph. The solution is for the cycle with even number of nodes, or odd number of nodes the 2 or 3 colors are sufficient for finding the chromatic number of a graph. Similarly, the Planer graphs (Where the edges are not crossing) and the face maps (such as geographical maps) can be colored effectively simply using the four colors. The solutions are based on the mathematical theorems proved using the concept of induction.
This program is an solution to the Graph Coloring problem using the concept of various mathematical theorems based on the concept of the Bipartite graph. The solution is for the cycle with even number of nodes, or odd number of nodes the 2 or 3 colors are sufficient for finding the chromatic number of a graph. Similarly, the Planer graphs (Where the edges are not crossing) and the face maps (such as geographical maps) can be colored effectively simply using the four colors. The solutions are based on the mathematical theorems proved using the concept of induction.