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
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers14
Suggested Problems
-
3053 Solvers
-
Set the array elements whose value is 13 to 0
1457 Solvers
-
How long do each of the stages of the rocket take to burn?
561 Solvers
-
455 Solvers
-
Split bread like the Pharaohs - Egyptian fractions and greedy algorithm
98 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Coloring [0 1 0 1 1 0 2] seems to work for test case 2, giving it a chromatic number of 3 rather than 4.
yes.. corrected. Thanks for pointing it out :-)