T. Husfeldt

collaborators

3 papers

math.CO2026

Counting equitable $k$ -colorings in graphs of bounded clique-width

Holger Dell, Thore Husfeldt, Amir Nikabadi

For a graph $G$ , a proper $k$ -coloring of $G$ is \emph{equitable} if the sizes of any two color classes differ by at most one. The \textsc{Equitable $k$ -Coloring} problem asks, for…

cs.DS2024

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture

Andreas BjÃ¶rklund, Radu Curticapean, Thore Husfeldt +2

In this paper we further explore the recently discovered connection by BjÃ¶rklund and Kaski [STOC 2024] and Pratt [STOC 2024] between the asymptotic rank conjecture of Strassen [Pr…

cs.DS2024

Finding longer cycles via shortest colourful cycle

Andreas BjÃ¶rklund, Thore Husfeldt

We consider the parameterised $k, e$ -Long Cycle problem, in which you are given an $n$ -vertex undirected graph $G$ , a specified edge $e$ in $G$ , and a positive integer $k$ , and are…

Counting equitable k-colorings in graphs of bounded clique-width

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture

Finding longer cycles via shortest colourful cycle

Counting equitable $k$ -colorings in graphs of bounded clique-width