Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 4
Number of items: 4
  • Open Access
    Bencs, F., Huijben, J., & Regts, G. (2024). Approximating the chromatic polynomial is as hard as computing it exactly. Computational Complexity, 33(1), Article 1. https://doi.org/10.1007/s00037-023-00247-8
  • Open Access
    Huijben, J., Patel, V., & Regts, G. (2023). Sampling from the low temperature Potts model through a Markov chain on flows. Random Structures and Algorithms, 62(1), 219-239. https://doi.org/10.1002/rsa.21089
  • Open Access
    Regts, G., Huijben, J., & Bencs, F. (2023). On the location of chromatic zeros of series-parallel graphs. The Electronic Journal of Combinatorics, 30(3), Article P3.2. https://doi.org/10.37236/11204
  • Open Access
    Huijben, J. (2023). Chromatic polynomials: Zeros, algorithms and computational complexity. [Thesis, fully internal, Universiteit van Amsterdam].
Page of