1 votes 1 votes can somebody explain the logic behind this theorem ? Graph Theory graph-theory discrete-mathematics graph-connectivity engineering-mathematics + – Vicky rix asked Mar 9, 2017 Vicky rix 340 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes now you can verify min no of color required for maximum degree, you can see that chromatic no= dmax + 1 only in case of graph will be complete or its subgraph will be complete. 2018 answered Mar 9, 2017 2018 comment Share Follow See all 0 reply Please log in or register to add a comment.