455 views

2 Answers

Best answer
4 votes
4 votes
Count the number of unique colors => 4

Hence, this graph is a 4 - chromatic graph.
selected by
Answer:

Related questions

0 votes
0 votes
3 answers
1
Arjun asked Oct 10, 2016
613 views
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
3 votes
3 votes
1 answer
2
Arjun asked Oct 10, 2016
502 views
The maximum number of possible edges in an undirected simple graph with $100$ vertices and $5$ components is ___
0 votes
0 votes
2 answers
3
Arjun asked Oct 10, 2016
555 views
A vertex having no incident edge is called -pendent vertex end vertexisolated vertex none of these