How Do I Change The Code So I Can Get A Colored Vertex Graph?

See more:

C++

I don't usually ask questions this generally but i'm really lost.
I'm trying to color the vertexes of my graph in a way that I use the least colors possible and that none of the two vertexes next to each other have the same color.
I can't even understand the answer my program gives me when I compile it and I really don't know where I'm going wrong!!!

class graphcoloring
{
	int n,m;
	int * Vcolor;
	int **w;
public:
	graphcoloring (int N)
	{
		n=N;
		m=N;
		w=new int*[n];
		for(int i=0; i<=n; ++i)
		{
			w[i]=new int[n];
		}
		Vcolor=new int[m];
	}
	
	void m_coloring(int i)
	{
		int color;
	if(promising(i))
		if(i==n)
			for(int i=1;i<=n;i++)
			{
			cout<<Vcolor[i] ;
			}
		else
			for(color=1;color<=m;color++)
			{
				Vcolor[i+1]=color;
			    m_coloring(i+1);
			}
	}
	bool promising(int i)
	{
		int j;
		bool change;
		change=true;
		j=1;
		while(j<i)
                {
                        mode="hold";
			if(w[i][j] && Vcolor[i]==Vcolor[j])
			{
				change=false;
				j++;
			}
                
			return change;
                }
	}
}
	void solve(){
     n=1;
     m=0;
	 m_coloring(1);
  }
};

int main()
{
	int n;
	cout << " n ? " ; cin >> n;
	graphcoloring s(n);
	s.solve();
	system("pause");
	return  EXIT_SUCCESS;
}