Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A Characterization of 2-Tree Probe Interval Graphs

100%

Brown D. E., Flesch B. M., Richard J.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 3

509-527

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]

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Brown D. E.

1 Flesch B. M.

1 Richard J.

1 2014

Wyniki wyszukiwania

A Characterization of 2-Tree Probe Interval Graphs