The chromatic number of the following graph is _______.

5a9624d82bb8d71065f0b66c 16424163985521

This question was previously asked in
GATE CS 2018 Official Paper
View all GATE CS Papers >

Answer (Detailed Solution Below) 3

Free
GATE CS Full Mock Test
5.3 K Users
65 Questions 100 Marks 180 Mins

Detailed Solution

Download Solution PDF

Concept:

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color 

Start coloring from the highest degree vertex and be stringent with the number of new colors.

Analysis:-

In this case, 3 colors are sufficient in properly coloring the graph.

5a9624d82bb8d71065f0b66c 16424163985582
hence, 3 colors required to color the above graph.

Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

More Graph Theory Questions

Hot Links: teen patti winner teen patti cash teen patti master apk download