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 Solvers13
Suggested Problems
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
Sum all integers from 1 to 2^n
17878 Solvers
-
Determine if input is a Narcissistic number
219 Solvers
-
Find out the Gray Code for a Given Binary Number
120 Solvers
-
It's going down. We're finding simbers!
87 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 :-)