Abstract
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).
Cite
CITATION STYLE
APA
Aboulker, P., Bousquet, N., & de Verclos, R. (2022). Chordal directed graphs are not directed χ-bounded. Electronic Journal of Combinatorics, 29(2). https://doi.org/10.37236/11050
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free