Covering the edge set of a directed graph with trees

Abstract

Let G be a finite directed graph, and s a specified vertex in G, such that the edge set of G can be covered with a collection of spanning arborescences rooted at s. The paper establishes the cardinality m of a minimum such collection. It is also shown that when G is acyclic, m equals the maximum of the invalences of vertices in G.