Some results on chromatic polynomials of hypergraphs (Q2380250)

Summary: Chromatic polynomials of (non-uniform) hypercycles, unicyclic hypergraphs, hypercacti and sunflower hypergraphs are presented. The formulae generalize known results for \(r\)-uniform hypergraphs due to \textit{J. A. Allagan} [Comput. Sci. J. Mold. 13, No.~1, 9--12 (2005; Zbl 1080.68083); Congr. Numerantium 187, 156--160 (2007; Zbl 1133.05029)], \textit{M. Borowiecki} and \textit{E. Łazuka} [Discuss. Math., Graph Theory 20, No.~2, 293--301 (2000; Zbl 0979.05044)], \textit{K. Dohmen} [Düsseldorf: Math.-Naturwiss. Fak., Univ. Düsseldorf, 25 S. (1993; Zbl 0837.05057)] and \textit{I. Tomescu} [J. Comb. Theory, Ser. B 72, No.~2, 229--235 (1998; Zbl 0914.05024); Discrete Math. 307, No.~6, 781--786 (2007; Zbl 1113.05039)]. Furthermore, it is shown that the class of (non-uniform) hypertrees with \(m\) edges, where \(m_r\) edges have size \(r\), \(r\geq 2\), is chromatically closed if and only if \(m\leq 4\), \(m_2\geq m-1\).