Chordal Directed Graphs Are Not $\chi$-Bounded
Résumé
We show that digraphs with no transitive tournament on $3$ vertices and in which every induced directed cycle has length $3$ can have arbitrarily large dichromatic number. This answers in the negative a question of Carbonero, Hompe, Moore, and Spirkl (and strengthens one of their results).
Domaines
Mathématique discrète [cs.DM]| Origine | Publication financée par une institution |
|---|
