πŸ“Š Design and Analysis of Algorithms
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.


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

πŸ‘οΈ
1013
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
91%
Success Rate