Hidde Koerts

most citedOn heroes in digraphs with forbidden induced forests

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Intersections of graphs and $χ$ -boundedness

Aristotelis Chaniotis, Hidde Koerts, Sophie Spirkl

Given $k$ graphs $G_{1}, \dots, G_{k}$ , their intersection is the graph $(\cap_{i \in [k]} V (G_{i}), \cap_{i \in [k]} E (G_{i}))$ . Given $k$ graph classes $\mathcal{G}_{1}, \ldots , \m…

math.CO2025

Orientations of cycles in digraphs of high chromatic number and high minimum out-degree

Hidde Koerts, Benjamin Moore, Sophie Spirkl

We characterize all orientations of cycles $C$ for which for every fixed $ε > 0$ there exists a constant $c \geq 1$ such that every digraph $D$ without loops or parallel…

math.CO2023★ 1 cited

On heroes in digraphs with forbidden induced forests

Alvaro Carbonero, Hidde Koerts, Benjamin Moore +1

We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs $C$ , a hero in $C$ i…

Intersections of graphs and χ-boundedness

Orientations of cycles in digraphs of high chromatic number and high minimum out-degree

On heroes in digraphs with forbidden induced forests

Intersections of graphs and $χ$ -boundedness