Register

Discrete

689 views

1 Answer

Best answer
2 votes
2 votes
Since graph has degree with 3 so minimum 3 colors are needed. here 3 colors are sufficeant.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
mathematics asked Oct 19, 2017
315 views
Discrete
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above
User Avatar
0 votes
0 votes
0 answers
2
mathematics asked Oct 19, 2017
1,690 views
Discrete
If G is a Cubic Hamiltonian graph, then χ′(G)= (a) 3 (b) 4 (c) 5 (d) None of the above
If G is a Cubic Hamiltonian graph, then χ′(G)=(a) 3 (b) 4 (c) 5 (d) None of the above
User Avatar
0 votes
0 votes
1 answer
3
mathematics asked Oct 19, 2017
371 views
Discrete
Find the chromatic number of the graph G below (a) 3 (b) 4 (c) 5 (d) None of the above
Find the chromatic number of the graph G below (a) 3 (b) 4 (c) 5 (d) None of the above
User Avatar
0 votes
0 votes
1 answer
4
mathematics asked Oct 19, 2017
510 views
Discrete
Consider the graph G given below. The graph G is (a) planar (b) non- planar
Consider the graph G given below. The graph G is (a) planar (b) non- planar
User Avatar
Link Copied!