Problem 2461. Graph Algorithms - 2 : Chromatic Number
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
Solution Comments
Show commentsProblem Recent Solvers12
Suggested Problems
-
2350 Solvers
-
Get the area codes from a list of phone numbers
1035 Solvers
-
Reverse the Words (not letters) of a String
433 Solvers
-
Omit columns averages from a matrix
579 Solvers
-
Flag largest magnitude swings as they occur
670 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!