Nowadays, graphs including bigraphs are mostly used in various real-world applications such as search engines and social networks. The bigraph or bipartite graph is a graph whose vertex set is split into two disjoint vertex sets such that there is no edge between the same vertex set. The bipartite graphs are colored using only two colors. This article checks if a given graph is bipartite or not and finds the color assignments of the bipartite graph using Java implementation.

Recently graph coloring is applied in some real-world applications that involve different types of networks including bipartite graphs. There are two colors are used to color any bipartite graph in which the vertex set is colored with the same integer. This research develops an algorithm for coloring a bipartite graph and the results are tested on sample instances.

Graph coloring, an NP-complete problem is used in many real-world applications. The minimum color, that is, the chromatic number of a connected graph is determined using different soft computing strategies. This article gives some of the solutions obtained for queen graphs using evolutionary methods.