Graph Colouring
In this tutorial, We will learn about the graph colouring problem in graph theory
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
In this tutorial, We will learn about the graph colouring problem in graph theory
Vertex Colouring
You have given m colours, find a way of colouring the vertices of a graph such that no two adjacent vertices are coloured using the same colour.Chromatic Number
The minimum number of colours that needed to color a graph is called its chromatic number.Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Comments
Post a Comment