Cody

# Problem 2461. Graph Algorithms - 2 : Chromatic Number

Solution 523023

Submitted on 6 Nov 2014 by James
• Size: 40
• This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
%% x = [0 1 1 0; 1 0 1 1 ; 1 1 0 0 ; 0 1 0 0]; y_correct = 3; assert(isequal(gColor(x),y_correct))

ans = 3

2   Pass
%% x = [0 1 0 0 1 0 1;1 0 1 0 0 0 1; 0 1 0 1 0 0 1; 0 0 1 0 0 1 1 ; 1 0 0 0 0 0 1 ; 0 0 0 1 0 0 1; 1 1 1 1 1 1 0]; y_correct = 3; assert(isequal(gColor(x),y_correct))

ans = 3

3   Pass
%% x = fliplr(eye(2)); y_correct = 2; assert(isequal(gColor(x),y_correct));

ans = 2

4   Pass
%% x = [0 1 1 0 1;1 0 0 1 0;1 0 0 1 0;0 1 1 0 1;1 0 0 1 0]; y_correct = 2; assert(isequal(gColor(x),y_correct));

ans = 2

5   Pass
%% x = [0 1 1 0 1;1 0 0 1 0;1 0 0 1 0;0 1 1 0 1;1 0 0 1 0]; y_correct = 2; assert(isequal(gColor(x),y_correct)); x = zeros(2); % two vertices, not connected by any edge y_correct = 1; assert(isequal(gColor(x),y_correct));

ans = 2 ans = 1

### Community Treasure Hunt

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

Start Hunting!