Java program to find out whether a given graph is Bipartite or not . Using recursion .
class GFG { static final int V = 4 ; static boolean colorGraph ( int G [ ] [ ] , int color [ ] , int pos , int c ) { if ( color [ pos ] != - 1 && color [ pos ] != c ) return false ;