1.6k citations · 1.8k across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CC2022
Approximating the chromatic polynomial is as hard as computing it exactly
Ferenc Bencs, Jeroen Huijben, Guus Regts
We show that for any non-real algebraic number such that or it is \textsc{\#P}-hard to compute a multiplicative (resp. additive) approximation to…
math.CO2022
On the location of chromatic zeros of series-parallel graphs
Ferenc Bencs, Jeroen Huijben, Guus Regts
In this paper we consider the zeros of the chromatic polynomial of series-parallel graphs. Complementing a result of Sokal, showing density outside the disk , we show d…