Question 7785 – Digital-Logic-Design
April 13, 2024UGC NET CS 2012 June-Paper2
April 13, 2024UGC NET CS 2012 June-Paper2
| Question 4 |
The number of colours required to properly colour the vertices of every planar graph is
| 2 | |
| 3 | |
| 4 | |
| 5 |
Question 4 Explanation:
→ The 4-colour theorem of the planar graph describes that any planar can at most be colored with 4 colors.
→ The sufficient number of colors in worst case is 4 colors for any planar graph.
→ The sufficient number of colors in worst case is 4 colors for any planar graph.
Correct Answer: C
Question 4 Explanation:
→ The 4-colour theorem of the planar graph describes that any planar can at most be colored with 4 colors.
→ The sufficient number of colors in worst case is 4 colors for any planar graph.
→ The sufficient number of colors in worst case is 4 colors for any planar graph.