Unit IV Coloring A graph with n vertices is a complete graph if a d only if it's chromatic polynomial is pn(g)=g(g-1)(g-2)....(g-n+1) A graph G is a tree if and only if it's chromatic polynomial is pn(g)=g(g-1)^n-1 here g means lambda Page 85,86
No download links available.
