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:	interval graph probe interval graph 2-tree
Online Access:	https://doi.org/10.7151/dmgt.1754

id	doaj-77830cdd95404ab4932889cdd554fb20
record_format	Article
spelling	doaj-77830cdd95404ab4932889cdd554fb202021-09-05T17:20:20ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922014-08-0134350952710.7151/dmgt.1754dmgt.1754A Characterization of 2-Tree Probe Interval GraphsBrown David E.0Flesch Breeann M.1Richard J.2Department of Mathematics and Statistics Utah State University Logan, UT 84322, USAMathematics Department Western Oregon University Monmouth, OR 97361, USALundgren Department of Mathematical Sciences University of Colorado Denver Denver, CO 80217, USAA 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 probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by Pržulj and Corneil in [2-tree probe interval graphs have a large obstruction set, Discrete Appl. Math. 150 (2005) 216-231]https://doi.org/10.7151/dmgt.1754interval graphprobe interval graph2-tree
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Brown David E. Flesch Breeann M. Richard J.
spellingShingle	Brown David E. Flesch Breeann M. Richard J. A Characterization of 2-Tree Probe Interval Graphs Discussiones Mathematicae Graph Theory interval graph probe interval graph 2-tree
author_facet	Brown David E. Flesch Breeann M. Richard J.
author_sort	Brown David E.
title	A Characterization of 2-Tree Probe Interval Graphs
title_short	A Characterization of 2-Tree Probe Interval Graphs
title_full	A Characterization of 2-Tree Probe Interval Graphs
title_fullStr	A Characterization of 2-Tree Probe Interval Graphs
title_full_unstemmed	A Characterization of 2-Tree Probe Interval Graphs
title_sort	characterization of 2-tree probe interval graphs
publisher	Sciendo
series	Discussiones Mathematicae Graph Theory
issn	2083-5892
publishDate	2014-08-01
description	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 probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by Pržulj and Corneil in [2-tree probe interval graphs have a large obstruction set, Discrete Appl. Math. 150 (2005) 216-231]
topic	interval graph probe interval graph 2-tree
url	https://doi.org/10.7151/dmgt.1754
work_keys_str_mv	AT browndavide acharacterizationof2treeprobeintervalgraphs AT fleschbreeannm acharacterizationof2treeprobeintervalgraphs AT richardj acharacterizationof2treeprobeintervalgraphs AT browndavide characterizationof2treeprobeintervalgraphs AT fleschbreeannm characterizationof2treeprobeintervalgraphs AT richardj characterizationof2treeprobeintervalgraphs
_version_	1717786517349335040

A Characterization of 2-Tree Probe Interval Graphs

Similar Items