4 citations · 13 across the 16 of their papers we have counts for
3 papers · 1 filter
The smallest 5-chromatic tournament
Thomas Bellitto, Nicolas Bousquet, Adam Kabela +1
A coloring of a digraph is a partition of its vertex set such that each class induces a digraph with no directed cycles. A digraph is -chromatic if is the minimum number of…
Homomorphically Full Oriented Graphs
Thomas Bellitto, Christopher Duffy, Gary MacGillivray
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two diff…
On the minimum number of arcs in -dicritical oriented graphs
Pierre Aboulker, Thomas Bellitto, Frédéric Havet +1
The dichromatic number $\dic(D)$ of a digraph is the least integer such that can be partitioned into directed acyclic digraphs. A digraph is -dicritical if $\dic…