4 citations · 13 across the 16 of their papers we have counts for
19 papers
Inversion diameter and 2-edge-colored homomorphisms
Carmen Arana, Thomas Bellitto, Hector Buffière +3
In an oriented graph, the inversion of a subset of vertices X is the operation reversing the direction of every arc with both endpoints in X. Given a graph G, the inversion distanc…
Canadian Traveller Problems in Temporal Graphs
Thomas Bellitto, Johanne Cohen, Bruno Escoffier +2
This paper formalises the Canadian Traveller problem as a positional two-player game on graphs. We consider two variants depending on whether an edge is blocked. In the locally-inf…
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…
Locating Dominating Sets in local tournaments
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque +1
A dominating set in a directed graph is a set of vertices such that all the vertices that do not belong to have an in-neighbour in . A locating set is a set of verti…