Vidyalelo
Data Structure · Q603

Miscellaneous on Data Structures

Programming · Data Structure · question 603

Q603

Minimum number of colors required for proper edge coloring of a graph is called?

A.
Chromatic color
B.
Chromatic index
Answer
C.
Edge matching
D.
Color number

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board