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
-
Return the largest number that is adjacent to a zero
5184 Solvers
-
10138 Solvers
-
326 Solvers
-
730 Solvers
-
Numbers spiral diagonals (Part 2)
133 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!