A characterisation of rigid circuit graphs

Citations of this article
Mendeley users who have this article in their library.


A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals overlap and at least one of them is a probe. PIGs are a generalization of interval graphs introduced by Zhang for an application concerning the physical mapping of DNA in the human genome project. PIGs have been characterized in the cycle-free case by Sheng, and other miscellaneous results are given by McMorris, Wang, and Zhang. Johnson and Spinrad give a polynomial time recognition algorithm for when the partition of vertices into probes and nonprobes is given. The complexity for the general recognition problem is not known. Here, we restrict attention to the case where all intervals have the same length, that is, we study the unit probe interval graphs and characterize the cycle-free graphs that are unit probe interval graphs via a list of forbidden induced subgraphs.




Buneman, P. (1974). A characterisation of rigid circuit graphs. Discrete Mathematics, 9(3), 205–212. https://doi.org/10.1016/0012-365X(74)90002-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free