A graph is found to be 2 colorable. What can be said about that graph?

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Design and Analysis of Algorithms

Q. A graph is found to be 2 colorable. What can be said about that graph?

(A) the given graph is eulerian
(B) the given graph is bipartite
(C) the given graph is hamiltonian
(D) the given graph is planar

💬 Discuss

✅ Correct Answer: (B) the given graph is bipartite

Explanation: a graph is said to be colorable if two vertices connected by an edge are never of the same color. 2 colorable mean that this can be achieved with just 2 colors.

Explanation by: Mr. Dubey

a graph is said to be colorable if two vertices connected by an edge are never of the same color. 2 colorable mean that this can be achieved with just 2 colors.

💬 Discussion

📊 Question Analytics

👁️

473

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate