Problem 2461. Graph Algorithms - 2 : Chromatic Number

Created by rifat
Appears in Advanced Cryptography Algorithms and Mathematics

Difficulty:Rate

Solve Later
Add To GroupÃ‚

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

59 Solutions
12 Solvers

Last Solution submitted on Jun 19, 2023

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Tim on 24 Jul 2014

Coloring [0 1 0 1 1 0 2] seems to work for test case 2, giving it a chromatic number of 3 rather than 4.

rifat on 25 Jul 2014

yes.. corrected. Thanks for pointing it out :-)

Solution Comments

Show comments

FEATURED DISCUSSION

PIVlab surpasses 100K all-time File Exchange downloads

During the past twelve months, PIVlab, a MATLAB Community Toolbox for particle...

Mike Croucher in General

View Post

Problem Recent Solvers12

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 2461. Graph Algorithms - 2 : Chromatic Number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

PIVlab surpasses 100K all-time File Exchange downloads

Problem Recent Solvers12

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

Problem 2461. Graph Algorithms - 2 : Chromatic Number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

PIVlab surpasses 100K all-time File Exchange downloads

Problem Recent Solvers12

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

Players