Pierre Aboulker, Guillaume Aubian, Raphael Steiner
Published 2022-02-18Version 1
We characterize all digraphs $H$ such that orientations of chordal graphs with no induced copy of $H$ have bounded dichromatic number.
Transitivity on subclasses of chordal graphs
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
Glauber dynamics for colourings of chordal graphs and graphs of bounded treewidth
![QR code for arXiv:2202.09191 [math.CO]](http://oss.arxitics.com/images/favicon.svg)