Millionaire Mode

Coloring Graphs

Question 1 of 15

What is the chromatic number of a graph?

  1. The minimum number of colors required to color the vertices of a graph such that no two adjacent vertices have the same color.
  2. The maximum number of colors required to color the vertices of a graph such that no two adjacent vertices have the same color.
  3. The number of vertices in a graph.
  4. The number of edges in a graph.

Prize Money

15₹7 Crores
14₹1 Crore
13₹50,00,000
12₹25,00,000
11₹12,50,000
10₹6,40,000
9₹3,20,000
8₹1,60,000
7₹80,000
6₹40,000
5₹20,000
4₹10,000
3₹5,000
2₹2,000
1₹1,000