Testing Eulerianity and connectivity in directed sparse graphs

In this paper, we focus on testing properties of directed graphs (digraphs). In particular, we present the following results (where n is the number of vertices in the graph, d is the maximum degree, and davg is the average degree).