A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood and the in-neighbourhood of any vertex induce a semicomplete digraph. In this paper we study various subclasses of locally semicomplete digraphs for which we give structural decomposition theorems. As a consequence we obtain several applications, among which an answer to a conjecture of Naserasr and the first and third authors: if an oriented graph is such that the out-neighbourhood of every vertex induces a transitive tournament, then one can partition its vertex set into two acyclic digraphs.

翻译：如果任何两个脊椎至少有一个弧连接在一起,如果任何脊椎的外邻和在邻内的脊椎引起半完整的分划线,这种分划线就半成半成品。在本文中,我们研究各种当地半成品分解分解分解分解法的子类。结果,我们获得若干应用,其中对纳塞拉斯尔的预测和第一及第三作者的预测有一个答案:如果一个方向图显示每个脊椎的外邻导致过渡性比赛,那么人们就可以将其脊椎分割成两个循环式的分解法。