10 citations · 21 across the 16 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
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…
cs.DS2017★ 2 cited
Shorter tours and longer detours: Uniform covers and a bit beyond
Arash Haddadan, Alantha Newman, R. Ravi
Motivated by the well known four-thirds conjecture for the traveling salesman problem (TSP), we study the problem of {\em uniform covers}. A graph has an -uniform cove…
math.CO2017
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…