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
-
2530 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3704 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2883 Solvers
-
Converting numbers back from extended form
129 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
424 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 :-)