The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+6 votes
238 views

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is

in Graph Theory by Boss (35.2k points) | 238 views
+1
4 colors ?
+1
is it 4?
+5

4 colors 

0
Is 4 colors needed?
0
E, F, G are adjacent, hence they cant be of the same color, here you have marked them as C1. check again.

I'm getting 4 colors also.
+1

I also got $4$ Colors

0
Minimum 4 colors must be required.
0
Yes that's right.
0
Here i need a minimum of 4 independent sets {b,d,h},{a,g},{f,c},{c,g} whose union gives me entire graph.. So i need 4 colours

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,362 questions
55,786 answers
192,411 comments
90,919 users