Neighborhood subtree tolerance graphs
type: Item
instance of: scholarly article
title: Neighborhood subtree tolerance graphs
zbMATH Open document ID: 0788.05083
DOI: 10.1016/0166-218X(93)90165-K
author: Eric Bibelnieks
author: P. M. Dearing
published in: Discrete Applied Mathematics
publication date: 1993-08-17T00:00:00Z
review text: The notion of interval tolerance graphs is extended to so-called neighborhood subtree tolerance graphs. Some relationships between these to notions as well as to weakly triangulated graphs are examined.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 205571
zbMATH Keywords: intersection graphs
zbMATH Keywords: tolerance graphs
reviewed by: Peter Kirschenhofer
MaRDI profile type: Publication
cites work: A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
cites work: Characterizations of strongly chordal graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q3328583
cites work: The edge intersection graphs of paths in a tree
cites work: Q3322150
cites work: Tolerance graphs
cites work: Weakly triangulated graphs
cites work: Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
cites work: Q4873748
cites work: General results on tolerance intersection graphs
cites work: Threshold tolerance graphs
cites work: A Class of Balanced Matrices Arising from Location Problems
full work available at URL: 0166-218x(93)90165-k
OpenAlex ID: W2077615138
description: scientific article; zbMATH DE number 205571