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
-
Remove the two elements next to NaN value
642 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
10253 Solvers
-
147 Solvers
-
4343 Solvers
-
Return fibonacci sequence do not use loop and condition
519 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!