Problem 2461. Graph Algorithms - 2 : Chromatic Number

Chromatic number of a graph is the minimum number of distinct colors required to color all the vertices of the graph such that no two adjacent vertices (vertices that are connected by an edge) have same color. Adjacency matrix of a graph is given. Determine its chromatic number.

Solution Stats

51.35% Correct | 48.65% Incorrect
Last Solution submitted on Jan 16, 2020

Problem Comments