9,614 views

2 Answers

Best answer
3 votes
3 votes

According to the 4-color theorem states that the vertices of every planar graph can be colored with at most 4 colors so that no two adjacent vertices receive the same color.

Hence,Option(C)4 is the correct choice

selected by
Answer:

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Jul 7, 2016
3,010 views
The upper bound of computing time of m colouring decision problem is$O(nm)$$O(n^m)$$O(nm^n)$$O(n^mm^n)$
3 votes
3 votes
2 answers
3
go_editor asked Jul 5, 2016
22,547 views
To represent hierarchical relationship between elements, which data structure is suitable?DequeuePriorityTreeAll of the above
2 votes
2 votes
2 answers
4
go_editor asked Jul 5, 2016
7,009 views
Which of the following data structure is linear type?StringsListsQueuesAll of the above