刻画圆弧接触 $B_0$-VPG 图
Characterising circular-arc contact $B_0$-VPG graphs
AI总结：
本文针对圆弧图类中的接触 $B_0$-VPG 图，给出了最小禁用导出子图刻画，并提出了一种多项式时间的识别算法。
摘要：
接触 $B_0$-VPG 图是指存在一组非平凡的、内部互不相交的水平与垂直线段，与其顶点集一一对应，且两顶点相邻当且仅当对应线段相切的图。Deniz 等人证明了接触 $B_0$-VPG 图的识别问题是 $\mathsf{NP}$-完全的。本文给出了圆弧图类中接触 $B_0$-VPG 图的最小禁用导出子图刻画，并提供了识别这些图的多项式时间算法。
英文摘要：
A contact $B_0$-VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in one-to-one correspondence with its vertex set such that two vertices are adjacent if and only if the corresponding segments touch. It was shown by Deniz et al. that Recognition is $\mathsf{NP}$-complete for contact $B_0$-VPG graphs. In this paper we present a minimal forbidden induced subgraph characterisation of contact $B_0$-VPG graphs within the class of circular-arc graphs and provide a polynomial-time algorithm for recognising these graphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
