Question

-) If each and every vertex in G has degree at most 23 then G can have a vertex
colouring of
1 marks)​

Answer 1

Answer:

www.sanfoundry.com › discrete-ma...

Web results

Graphs Properties - Discrete Mathematics Questions and ...

If each and every vertex in G has degree at most 23 then G can have a vertex colouring