15 citations · 57 across the 24 of their papers we have counts for
4 papers · 1 filter
Domination and fractional domination in digraphs
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman +1
In this paper, we investigate the relation between the (fractional) domination number of a digraph and the independence number of its underlying graph, denoted by . More…
Coloring dense digraphs
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman +1
The chromatic number of a digraph is the minimum number of acyclic subgraphs covering the vertex set of . A tournament is a hero if every -free tournament has chr…
Coloring tournaments: from local to global
Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé +1
The \emph{chromatic number} of a directed graph is the minimum number of colors needed to color the vertices of such that each color class of induces an acyclic subdigr…
Exact distance coloring in trees
Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan +1
For an integer and an even integer , consider the graph obtained from a large complete -ary tree by connecting with an edge any two vertices at distance exactly …