On the location of chromatic zeros of series-parallel graphs
From MaRDI portal
Publication:6170518
DOI10.37236/11204zbMath1519.05127arXiv2204.10038OpenAlexW4384342743MaRDI QIDQ6170518
Unnamed Author, Ferenc Bencs, Guus Regts
Publication date: 10 August 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.10038
Graph polynomials (05C31) Normal functions of one complex variable, normal families (30D45) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Approximating the chromatic polynomial is as hard as computing it exactly ⋮ On the location of chromatic zeros of series-parallel graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complex dynamics
- Cayley trees do not determine the maximal zero-free locus of the independence polynomial
- On a conjecture of Sokal concerning roots of the independence polynomial
- Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel 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
- Lee-Yang zeros of the antiferromagnetic Ising model
- Inapproximability of the Independent Set Polynomial in the Complex Plane
- On the location of chromatic zeros of series-parallel graphs
This page was built for publication: On the location of chromatic zeros of series-parallel graphs