Some properties of chromatic coefficients of linear uniform hypergraphs
From MaRDI portal
(Redirected from Some properties of chromatic coefficients of linear uniform hypergraphs)
Let \(n, g, h\) be positive integers such that \((g,h) \neq (3,3)\). Let \(H\) be an \(h\)-uniform hypergraph on \(n\) vertices that has girth \(g\). In the paper, a formula is given for the \((n - gh + g - 1)\)st coefficient of the chromatic polynomial of \(H\).
Recommendations
- Chromatic coefficients of linear uniform hypergraphs
- scientific article; zbMATH DE number 5237267
- A contribution to the chromatic theory of uniform hypergraphs
- On the chromaticity of quasi linear hypergraphs
- Some results on chromaticity of quasilinear hypergraphs
- scientific article; zbMATH DE number 4198041
- Some results on chromatic polynomials of hypergraphs
- On chromaticity of hypergraphs
- scientific article; zbMATH DE number 989238
- Upper bounds on the linear chromatic number of a graph
Cites work
- A broken-circuits-theorem for hypergraphs
- Chromatic coefficients of linear uniform hypergraphs
- Chromatic polynomials of hypergraphs
- Chromatic polynomials of hypergraphs
- Coefficients of chromatic polynomials
- scientific article; zbMATH DE number 4010523 (Why is no real title available?)
- scientific article; zbMATH DE number 2199828 (Why is no real title available?)
- On chromaticity of hypergraphs
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
Cited in
(12)- Chromatic coefficients of linear uniform hypergraphs
- Zero-free intervals of chromatic polynomials of hypergraphs
- A Harary-Sachs theorem for hypergraphs
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- On chromatic polynomials of hypergraphs
- Problems on chromatic polynomials of hypergraphs
- Chromatically unique 6-bridge graphs \(\theta(r, r, r, s, t, u)\)
- scientific article; zbMATH DE number 5237267 (Why is no real title available?)
- Chromatic polynomials of hypergraphs
- Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II
- DP color functions of hypergraphs
This page was built for publication: Some properties of chromatic coefficients of linear uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844223)