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
-
Back to basics 21 - Matrix replicating
1822 Solvers
-
Number of 1s in a binary string
11548 Solvers
-
Get the length of a given vector
13706 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
266 Solvers
-
303 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 :-)