9 votes 9 votes The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is Graph Theory graph-theory discrete-mathematics graph-connectivity graph-coloring + – Mk Utkarsh asked Jan 10, 2018 Mk Utkarsh 1.1k views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Ashwin Kulkarni commented Jan 10, 2018 reply Follow Share 4 colors ? 1 votes 1 votes vijay_jr commented Jan 10, 2018 reply Follow Share is it 4? 1 votes 1 votes Anu007 commented Jan 10, 2018 reply Follow Share 4 colors 6 votes 6 votes mitesh kumar commented Oct 29, 2018 i edited by mitesh kumar Oct 16, 2019 reply Follow Share Is 4 colors needed? 0 votes 0 votes s9k96 commented Oct 29, 2018 reply Follow Share 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. 0 votes 0 votes Lakshman Bhaiya commented Oct 29, 2018 reply Follow Share I also got $4$ Colors 1 votes 1 votes kumar.dilip commented Oct 29, 2018 reply Follow Share Minimum 4 colors must be required. 0 votes 0 votes Lakshman Bhaiya commented Oct 29, 2018 reply Follow Share Yes that's right. 0 votes 0 votes chirudeepnamini commented Oct 16, 2019 reply Follow Share 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 0 votes 0 votes Please log in or register to add a comment.