Hidde Koerts

MaRDI QIDQ6400693zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Intersections of graphs and \(\chi\)-boundedness SIAM Journal on Discrete Mathematics	2026-04-01	Paper
Orientations of cycles in digraphs of high chromatic number and high minimum out-degree Combinatorica	2026-03-20	Paper
Faster 3-colouring algorithm for graphs of diameter 3 (available as arXiv preprint)	2026-01-01	Paper
Characterizing Large Clique Number in Tournaments (available as arXiv preprint)	2026-01-01	Paper
Decomposing tournaments into comparability graphs (available as arXiv preprint)	2026-01-01	Paper
Tree-independence number of $K_{1,d}$-free graph classes (available as arXiv preprint)	2026-01-01	Paper
Crossing tournaments are polynomially \vecχ-bounded (available as arXiv preprint)	2026-01-01	Paper
Almost perfect graph classes (available as arXiv preprint)	2026-01-01	Paper
On the k-independence number of graph products Discussiones Mathematicae. Graph Theory	2025-05-12	Paper
On the pre- and post-positional semi-random graph processes Journal of Graph Theory	2025-03-20	Paper
On heroes in digraphs with forbidden induced forests European Journal of Combinatorics	2025-01-16	Paper
On the complexity of the k-independence number and the h-diameter of a graph Matemática Contemporânea	2024-05-24	Paper
On the pre- and post-positional semi-random graph processes	2023-09-11	Paper
On heroes in digraphs with forbidden induced forests	2023-06-07	Paper
On the k-independence number of graph products	2022-05-31	Paper

Research outcomes over time

This page was built for person: Hidde Koerts