For a cycle graph of length , the chromatic polynomial is . The graph triangle gives the base case . For , the deletion-contraction recurrence for the chromatic polynomial gives , since deleting an edge leaves a path graph and contracting it gives the shorter cycle graph. Substitution proves the formula by mathematical induction.
Articles by others on the same topic
There are currently no matching articles.