Chromatic polynomials of simplicial complexes
Jesper M{\o}ller, Gesche Nord
TL;DR
This paper introduces s-chromatic polynomials for simplicial complexes, extending the concept of chromatic polynomials from graphs to higher-dimensional structures, providing a new combinatorial invariant.
Contribution
It defines and explores the properties of s-chromatic polynomials as higher-dimensional analogues of graph chromatic polynomials.
Findings
Defined s-chromatic polynomials for simplicial complexes
Established basic properties and potential applications
Extended chromatic polynomial concepts to higher dimensions
Abstract
We consider s-chromatic polynomials of simplicial complexes, higher dimensional analogues of chromatic polynomials for graphs.
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.