An efficient colouring of graphs using less number of colours

This paper describes an efficient algorithm for graph colouring problem using less number of colours. The proposed scheme is applicable for all types of graphs. The algorithm divides the neighbours of a vertex into two categories N-type and F-type, and checks the colour filled in V-type neighbour before filling in the current vertex. Algorithm selects a colour from the list of colours, K every time from the beginning of the list colour so that it can make use less number of colours. We compare our results with those obtained using genetic algorithms, Brown's algorithm and other heuristics algorithms. Experiments have been conducted on previously used standard graphs and configuration of graphs to demonstrate the effectiveness of our approach.