Read more from compalg.inf.elte.hu

We note that there is no easy characterisation of graphs with chromatic number greater or equal to three The graph vertex colouring problem is a standard NP  - Information from compalg.inf.elte.hu

We note that there is no easy characterisation of graphs with chromatic number greater or equal to three The graph vertex colouring problem is a standard NP  - Information from compalg.inf.elte.hu

The minimum number k for which there is a kcolouring of the graph is A complete graph with n vertices is nchromatic because all its vertices are  - Information from compalg.inf.elte.hu

A 2colourable and a 3colourable graph are shown in Figure 71 the chromatic number of the graph is the same as the original but the contraction of  - Information from compalg.inf.elte.hu

the chromatic number of the graph is the same as the original but the contraction of any G is an odd cycle or a bipartite graph for k 2 let k ≥ 3 - Information from compalg.inf.elte.hu