Characterising circular-arc contact B-VPG graphs.
arxiv(2019)
摘要
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 in Deniz et al. (2018) that RECOGNITION is 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. (C) 2020 Elsevier B.V. All rights reserved.
更多查看译文
关键词
Contact B-0-VPG,Circular-arc graphs,Contact graphs of paths on a grid
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要