Graph Algorithms - 2 : Chromatic Number - MATLAB Cody - MATLAB Central

Problem 2461. Graph Algorithms - 2 : Chromatic Number

Difficulty:
(32)
Rate

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.

Solve

Solution Stats

40.68% Correct | 59.32% Incorrect
Last Solution submitted on Jun 19, 2023

Problem Comments

Solution Comments

Show comments
Who Deserves Your Praise? Discover the New Contribution Widget!
...
We are excited to announce another update to our Discussions area: the...

Problem Recent Solvers12

Suggested Problems

More from this Author44

Problem Tags

graph theory

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page