Some applications of the chromatic polynomials
Mohammed Said Maamra, Miloud Mihoubi
TL;DR
This paper explores properties of chromatic polynomial coefficients and presents applications to restricted Stirling numbers, contributing to graph theory and combinatorics.
Contribution
It establishes new properties of chromatic polynomial coefficients and applies these to derive results involving restricted Stirling numbers.
Findings
Properties of chromatic polynomial coefficients are characterized.
New relations involving restricted Stirling numbers are derived.
Applications demonstrate the relevance in combinatorics and graph theory.
Abstract
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the coefficients of the chromatic polynomial of a graph. Three applications on restricted Stirling numbers of the second kind are given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Algebraic structures and combinatorial models