retagged by
1,199 views
0 votes
0 votes
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
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 ...
4 votes
4 votes
2 answers
2
Balaji Jegan asked Nov 27, 2018
2,499 views
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ?There is a condition that adjacent...
3 votes
3 votes
1 answer
3
3 votes
3 votes
1 answer
4
srestha asked Sep 21, 2018
1,531 views
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below gr...