Linda Cook

collaborators

3 papers

math.CO2026

On the chromatic number of the union of comparability graphs

Maria Chudnovsky, Wouter Cames van Batenburg, Linda Cook +3

Resolving in a strong sense a problem of GyÃ¡rfÃ¡s on the union of two perfect graphs, we prove that for every pair of positive integers $d$ and $k$ , there is a graph $G$ with cliq…

math.CO2026

Reuniting $I ¨ $ -boundedness with polynomial $I ¨ $ -boundedness

Maria Chudnovsky, Linda Cook, James Davies +1

A class $F$ of graphs is $I ¨ $ -bounded if there is a function $f$ such that $I ¨ (H) \leq f (I ¨ (H))$ for all induced subgraphs $H$ of a graph in $F$ . If $f$ can be ch…

math.CO2024

Colouring t-perfect graphs

Maria Chudnovsky, Linda Cook, James Davies +2

Perfect graphs can be described as the graphs whose stable set polytopes are defined by their non-negativity and clique inequalities (including edge inequalities). In 1975, ChvÃ¡ta…

On the chromatic number of the union of comparability graphs

Reuniting I¨-boundedness with polynomial I¨-boundedness

Colouring t-perfect graphs

Reuniting $I ¨ $ -boundedness with polynomial $I ¨ $ -boundedness