Problem 2461. Graph Algorithms - 2 : Chromatic Number

Created by rifat

Solve Later

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

Last solution submitted on Apr 18, 2019

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 :-)

Problem Recent Solvers7

Problem Tags

graph theory

Problem 2461. Graph Algorithms - 2 : Chromatic Number

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers7

Suggested Problems

More from this Author45

Problem Tags

Problem 2461. Graph Algorithms - 2 : Chromatic Number

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers7

Suggested Problems

More from this Author45

Problem Tags

Players