Finding the chromatic number of complete graph

Problem Statement

What is the chromatic number of complete graph K_n?

Solution

In a complete graph, each vertex is adjacent to is remaining (n–1) vertices. Hence, each vertex requires a new color. Hence the chromatic number K_n = n.

Mahesh Parahar

Updated on: 23-Aug-2019

3K+ Views

Kickstart Your Career

Get certified by completing the course

Get Started