0 votes 0 votes The $15$ parts of the given figure are to be painted such that no two adjacent parts with shared boundaries (excluding corners) have the same color. The minimum number of colors required is$4$$3$$5$$6$ Quantitative Aptitude gate-ds-ai-2024 quantitative-aptitude graph-coloring + – Arjun asked Feb 16 • edited Mar 16 by makhdoom ghaya Arjun 3.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes A. 4 four color theorem https://uu.diva-portal.org/smash/get/diva2:749857/FULLTEXT01.pdf gaurav0to1 answered Feb 16 • reshown Feb 17 by gaurav0to1 gaurav0to1 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes How answer is A, can anyone explain? Anmol Verma answered Feb 17 Anmol Verma comment Share Follow See 1 comment See all 1 1 comment reply jpj12345 commented Feb 17 reply Follow Share try coloring the graph from the inner circle. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 4 Rahiman159 answered Feb 17 Rahiman159 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes A. 4 We can't color with using only 3 colors.As given graph is planar so minimum no. of colors required to is 4.Well known four color theorem says "every planar graph is four-colorable".https://en.wikipedia.org/wiki/Four_color_theorem gaurav0to1 answered Feb 18 gaurav0to1 comment Share Follow See all 0 reply Please log in or register to add a comment.