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