630 views

2 Answers

1 votes
1 votes
For r- regular graph we will need a minimum of r color (ex - C5)and maximum of n-1 color. (Ex - K5).

A connected graph with no cycles is a tree and the chromatic number of a tree is 2. ( > 1 Vertex).
edited by
0 votes
0 votes
chromatic number of k regular graph is n

Equivalence relation between vertices of same color in a connected graph gives the chromatic partition.

Related questions

1 votes
1 votes
0 answers
1
0 votes
0 votes
1 answer
2
1 votes
1 votes
1 answer
3
0 votes
0 votes
1 answer
4
Sahil_Lather asked Apr 15, 2023
439 views
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...