Question

What is the condition for proper edge coloring of a graph?

(a) Two vertices having a common edge should not have same color

(b) Two vertices having a common edge should always have same color

(c) No two incident edges should have the same color

(d) No two incident edges should have different color

I have been asked this question during an internship interview.

I want to ask this question from Graph Coloring topic in chapter Graph Coloring of Data Structures & Algorithms II

Answer 1

Correct answer is (c) No two incident edges should have the same color

Easy explanation - The condition for proper edge coloring of graph is that no two incident edges should have the same color. If it uses k colors in the process then it is called k edge coloring of graph.