max no of edge in Bipartite graph=(n^2)/4 , when n is equally distributed both side.
here n=6, max edge =9 both side n/2 vertices means 3.
so G' will be disconnected having two component with 3 vertices each make odd cycle with 3-3 edges.
so chromatic no 3.