A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there are diverse characterizations of circle graphs, a structural characterization by minimal forbidden induced subgraphs for the entire class of circle graphs is not known, not even restricted to split graphs (which are the graphs whose vertex set can be partitioned into a clique and a stable set). In this work, we give a characterization by minimal forbidden induced subgraphs of circle graphs, restricted to split graphs.

中文翻译：

---

分割图中圆形图的禁止诱导子图表征

一个图是圆的，如果它的顶点与圆中的一个弦族对应，使得每两个不同的顶点相邻，当且仅当相应的弦有非空交点。尽管圆图有多种表征，但对于整个圆图类的最小禁止诱导子图的结构表征是未知的，甚至不限于分裂图（其顶点集可以划分为一个团和一个稳定的集合）。在这项工作中，我们通过圆形图的最小禁止诱导子图给出了一个特征，仅限于分割图。