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 Solvers12
Suggested Problems
-
Determine whether a vector is monotonically increasing
23288 Solvers
-
How to find the position of an element in a vector without using the find function
2816 Solvers
-
Back to basics 6 - Column Vector
1110 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
651 Solvers
-
Replace multiples of 5 with NaN
469 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 :-)