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...
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
-
Some Root Level Modifications in Interval Valued Fuzzy Graphs and Their Generalizations Including Neutrosophic Graphs
by: Naeem Jan, et al.
Published: (2019-01-01) -
The niche graphs of interval orders
by: Park Jeongmi, et al.
Published: (2014-05-01) -
Dombi Interval Valued Neutrosophic Graph and its Role in Traffic Control Management
by: D. Nagarajan, et al.
Published: (2019-03-01) -
Combination of interval-valued neutrosophic soft sets and graph theory
by: Yildiray Celik, et al.
Published: (2018-04-01) -
Mathematical Properties on the Hyperbolicity of Interval Graphs
by: Juan C. Hernández-Gómez, et al.
Published: (2017-11-01)