Zero-free intervals of chromatic polynomials of hypergraphs
From MaRDI portal
Publication:2005730
DOI10.1016/j.disc.2020.112134zbMath1448.05079arXiv1812.01814OpenAlexW3084365899MaRDI QIDQ2005730
Publication date: 8 October 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.01814
Graph polynomials (05C31) Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chromatic polynomials of some \((m,l)\)-hyperwheels
- Some properties of chromatic coefficients of linear uniform hypergraphs
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
- Mixed hypergraphs and other coloring problems
- Chromatic coefficients of linear uniform hypergraphs
- A broken-circuits-theorem for hypergraphs
- The largest real zero of the chromatic polynomial
- Zeros of chromatic and flow polynomials of graphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- Chromatic roots and Hamiltonian paths
- Sunflower hypergraphs are chromatically unique
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- Some results on chromatic polynomials of hypergraphs
- On the price of equivocation in byzantine agreement
- A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Chromatic Roots are Dense in the Whole Complex Plane
- Hypergraphs with pendant paths are not chromatically unique
- On chromatic number of graphs and set-systems
- An introduction to chromatic polynomials
- Approximation and Online Algorithms
- Chromatic Polynomials
- Chromatic polynomials of hypergraphs
This page was built for publication: Zero-free intervals of chromatic polynomials of hypergraphs
