Logo image
A characterization of cycle-free unit probe interval graphs
Journal article   Open access   Peer reviewed

A characterization of cycle-free unit probe interval graphs

David E. Brown, J. Richard Lundgren and Li Sheng
Discrete Applied Mathematics, v 157(4), pp 762-767
2009
url
https://doi.org/10.1016/j.dam.2008.07.004View
Published, Version of Record (VoR)Open Access (Publisher-Specific) Open

Abstract

Asteroidal triple-free Forbidden induced subgraph characterization Probe interval graph
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.

Metrics

11 Record Views
5 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
Web of Science research areas
Mathematics, Applied
Logo image