Help on k-coloring of a graph?

Revision en1, by duckladydinh, 2019-09-19 02:51:44


I am stuck on the following graph problem: How many k-colorings (exactly k, k is a constant) of a sparse graph of n vertexes (n <= 50000) with no connected component of size s having more than s + 2 edges (almost tree).

I am completely stuck!!!

Could someone give me a hint? It's a problem from Hong Kong Regional Online Preliminary 2016 (all of their problems are super hard).



  Rev. Lang. By When Δ Comment
en1 English duckladydinh 2019-09-19 02:51:44 434 Initial revision (published)