I need to compute the chromatic polynomial of a complete bipartite graph. I know that the chromatic polynomial of a complete graph is $\chi(G)= k(k-1)\dots(k-n+1)$. How can I extend this solution to a complete bipartite graph without using surjections or Stirling numbers.
Thanks for your help.