3 citations · 4 across the 12 of their papers we have counts for
6 papers · 1 filter
Almost perfect graph classes
Cicely Henderson, Hidde Koerts, Taite LaGrange +4
A graph is perfect if for each induced subgraph of . In 2002, Chudnovsky, Robertson, Seymour, and Thomas famously proved the Strong Perfect Graph Theorem.…
Crossing tournaments are polynomially -bounded
Lila Crew, Xinyue Fan, Hidde Koerts +2
Given a tournament , Aboulker, Aubian, Charbit, and Lopes (2023) defined its clique number as the minimum clique number of a backedge graph of , and raised the que…
Tree-independence number of -free graph classes
Kenny Bešter Štorgel, Mujin Choi, Hidde Koerts +1
In this paper, we investigate the tree-independence number of graph classes that do not contain as an induced subgraph. Dallard et al. conjectured that for any positive i…
Decomposing tournaments into comparability graphs
Pierre Aboulker, Logan Crew, Julien Duron +7
In this note, we introduce the \emph{partial order decomposition number} of a digraph , denoted , defined as the minimum integer such that $A(D)=A(P_1)\cup\cdots\cup…
Characterizing Large Clique Number in Tournaments
Logan Crew, Xinyue Fan, Hidde Koerts +2
Aboulker, Aubian, Charbit, and Lopes (2023) defined the clique number of a tournament to be the minimum clique number of one of its backedge graphs. Here we show that if is a t…
Faster 3-colouring algorithm for graphs of diameter 3
Carla Groenland, Hidde Koerts, Sophie Spirkl
We show that given an -vertex graph of diameter 3 we can decide if is -colourable in time for any . This improves on…