Question

4
The chromatic no. of a triangle is
a) 0
b) 1
c) 2
d) 3
20
4.​

Answer 1

Step-by-step explanation:

The chromatic number of a graph, χ(G), is the smallest k ∈ N such that G has a proper k-coloring. ... A graph is said to be triangle free if no two adjacent vertices are adjacent to a common vertex.