Problems on chromatic polynomials of hypergraphs
From MaRDI portal
Recommendations
Cites work
- A broken-circuits-theorem for hypergraphs
- An introduction to chromatic polynomials
- Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials
- Chromatic coefficients of linear uniform hypergraphs
- Chromatic polynomials of hypergraphs
- Chromatic polynomials of hypergraphs
- Chromatic polynomials of some \((m,l)\)-hyperwheels
- Chromatic polynomials of some mixed hypergraphs
- Expansions of Chromatic Polynomials and Log-Concavity
- scientific article; zbMATH DE number 3468904 (Why is no real title available?)
- scientific article; zbMATH DE number 833904 (Why is no real title available?)
- scientific article; zbMATH DE number 2199828 (Why is no real title available?)
- scientific article; zbMATH DE number 5237267 (Why is no real title available?)
- Hypergraphs with pendant paths are not chromatically unique
- On chromatic number of graphs and set-systems
- On chromaticity of hypergraphs
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
- Proof of a chromatic polynomial conjecture
- Some properties of chromatic coefficients of linear uniform hypergraphs
- Some results on chromatic polynomials of hypergraphs
- Sunflower hypergraphs are chromatically unique
- The Markov chain of colourings
- Two chromatic polynomial conjectures
Cited in
(6)- Some problems on chromatic polynomials
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- On chromatic polynomials of hypergraphs
- On partial chromatic ordinomials
- scientific article; zbMATH DE number 5064034 (Why is no real title available?)
- Bounds on Erdős-Faber-Lovász conjecture -- the uniform and regular cases
This page was built for publication: Problems on chromatic polynomials of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957990)
