Independent spanning trees with small depths in iterated line digraphs (Q5936460)

In this paper, independent spanning trees are constructed in iterated line digraphs. In fact, it is proved that if for a vertex \(r\) of a line digraph \(L(G)\) there exist \(k\) openly vertex-disjoint paths to any vertex \(v\neq r\), then there are \(k\) independent spanning trees rooted at \(r\) in \(L(G)\). This is an interesting result.