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 Solvers15
Suggested Problems
-
1718 Solvers
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
2180 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2083 Solvers
-
Create matrix of replicated elements
402 Solvers
-
Solving Quadratic Equations (Version 1)
507 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 :-)