Recent questions tagged graph-coloring

1 votes
1 answer
64
Consider a tree with n nodes, where a node can be adjacent to maximum 4 other nodes.Then the minimum number of color needed to color the tree, so that no two adjacent nod...
2 votes
3 answers
67
What is the chromatic number of following graphs?1)2)
1 votes
1 answer
68
0 votes
1 answer
69
3 votes
2 answers
70
1 votes
2 answers
71
8 votes
2 answers
72
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is$1$$k$$k-1$$k/2$
43 votes
4 answers
76
4 votes
4 answers
79
What is the minimum number of colors needed to color a graph with five vertices. The graph contain a cycle also
34 votes
4 answers
81
37 votes
7 answers
82
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is$2$$3$$4$$5$
46 votes
6 answers
83
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is$2$$3$$4$$n-2 \lef...
49 votes
11 answers
84
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n 2$.$2$$3$$n-1$ $n$