A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\to u_2\to \cdots \to u_t$, $t\ge 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\to u_j$ exist for $1\le i<j\le t$. An undirected graph is semi-transitive if it admits a semi-transitive orientation. Recognizing semi-transitive orientability of a graph is an NP-complete problem.

A split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Semi-transitive orientability of split graphs was recently studied in a series of papers in the literature. The main result in this paper is proving that recognition of semi-transitive orientability of split graphs can be done in a polynomial time.

有向图是半传递的当且仅当它是无环的并且对于任何有向路径${你}_1\to {你}_2\to \cdots \to {你}_t$,$t\ge 2$，要么没有边${你}_1$到${你}_t$或所有边缘${你}_{我}\to {你}_j$存在于$1\le 我<j\le t$。如果无向图允许半传递方向，则它是半传递的。识别图的半传递可定向性是一个 NP 完全问题。

分裂图是其中顶点可以划分为团和独立集的图。最近在文献中的一系列论文中研究了分裂图的半传递可定向性。本文的主要结果是证明分裂图的半传递可定向性的识别可以在多项式时间内完成。