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 commentsJoin Cody Contest 2025 — Have Fun and Win Prizes!
Problem Recent Solvers12
Suggested Problems
-
11531 Solvers
-
307 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
239 Solvers
-
839 Solvers
-
Sum the numbers on the main diagonal
599 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!
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: United States.
You can also select a web site from the following list
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom(English)
Asia Pacific
- Australia (English)
- India (English)
- New Zealand (English)
- 中国
- 日本Japanese (日本語)
- 한국Korean (한국어)