Q. What type of graph has chromatic number less than or equal to 2?

(A) histogram
(B) bipartite
(C) cartesian
(D) tree

💬 Discuss

✅ Correct Answer: (B) bipartite

Explanation: a graph is known as bipartite graph if and only if it has the total chromatic number less than or equal to 2. the smallest number of graphs needed to color the graph is chromatic number.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

a graph is known as bipartite graph if and only if it has the total chromatic number less than or equal to 2. the smallest number of graphs needed to color the graph is chromatic number.

💬 Discussion

📊 Question Analytics

👁️

1041

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

98%

Success Rate

Q. What type of graph has chromatic number less than or equal to 2?

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics