On chromatic polynomials of hypergraphs
From MaRDI portal
Recommendations
Cites work
- A broken-circuits-theorem for hypergraphs
- An introduction to chromatic polynomials
- Chromatic coefficients of linear uniform hypergraphs
- Coefficients of chromatic polynomials
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- On chromatic coefficients
- On chromaticity of hypergraphs
Cited in
(18)- A geometric theory of hypergraph colouring
- Holomorphic quadratic differentials on graphs and the chromatic polynomial
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- Chromatic polynomials of mixed hypercycles
- On k-chromatically unique and k-chromatically equivalent hypergraphs
- Mixed colorings of hypergraphs
- scientific article; zbMATH DE number 833904 (Why is no real title available?)
- Chromatic polynomials of some \((m,l)\)-hyperwheels
- CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR
- Note on chromatic polynomials of the threshold graphs
- On the Chromatic Thresholds of Hypergraphs
- On the absolute sum of chromatic polynomial coefficient of graphs
- scientific article; zbMATH DE number 5237267 (Why is no real title available?)
- Chromatic polynomials of hypergraphs
- Polychromatic colorings of unions of geometric hypergraphs
- On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
- On r-chromatic hypergraphs
This page was built for publication: On chromatic polynomials of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439420)