The chromatic polynomial for cycle graphs

From MaRDI portal



Abstract: Let P(G,lambda) denote the number of proper vertex colorings of G with lambda colors. The chromatic polynomial P(Cn,lambda) for the cycle graph Cn is well-known as P(C_n,lambda) = (lambda-1)^n+(-1)^n(lambda-1) for all positive integers nge1. Also its inductive proof is widely well-known by the emph{deletion-contraction recurrence}. In this paper, we give this inductive proof again and three other proofs of this formula of the chromatic polynomial for the cycle graph Cn.












This page was built for publication: The chromatic polynomial for cycle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204511)