A Characterization of 2-Tree Probe Interval Graphs

A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P. We characterize the 2-trees which are pr...

Full description

Bibliographic Details
Main Authors: Brown David E., Flesch Breeann M., Richard J.
Format: Article
Language:English
Published: Sciendo 2014-08-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1754

Similar Items