The chromatic polynomial for cycle graphs
From MaRDI portal
Abstract: Let denote the number of proper vertex colorings of with colors. The chromatic polynomial for the cycle graph is well-known as P(C_n,lambda) = (lambda-1)^n+(-1)^n(lambda-1) for all positive integers . 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 .
Recommendations
Cited in
(9)- Cycle lengths and chromatic number of graphs
- The chromatic polynomial of a digraph
- A generalization of the chromatic polynomial of a cycle
- scientific article; zbMATH DE number 6011067 (Why is no real title available?)
- Chromatic polynomials of C₄ P_n and C₅ P_n
- scientific article; zbMATH DE number 1488856 (Why is no real title available?)
- On the chromatic polynomial of a cycle graph
- scientific article; zbMATH DE number 3319302 (Why is no real title available?)
- Bijective proofs of formulas with (-1)^n
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)