AbstractWe establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees of a tree) and several subclasses. In particular, we show the equivalence of proper NeST graphs and unit NeST graphs, the equivalence of fixed distance NeST graphs and threshold tolerance graphs, and the proper containment of NeST graphs in weakly chordal graphs. The latter two results answer questions of Monma, Reed and Trotter, and Bibelnieks and Dearing
AbstractA chordal graph is the intersection graph of a family of subtrees of a host tree. In this pa...
AbstractTolerance graphs have been extensively studied since their introduction, due to their intere...
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree...
AbstractWe establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees ...
AbstractIn this paper, we introduce neighborhood subtree tolerance (NeST) graphs which are defined i...
AbstractA chordal graph is the intersection graph of a family of subtrees of a tree, or, equivalentl...
AbstractA chordal graph is the intersection graph of a family of subtrees of a tree, or, equivalentl...
AbstractWe answer a question of Golumbic, Monma and Trotter by constructing proper tolerance graphs ...
A graph G=(V, E) is a threshold tolerance if it is possible to associate weights and tolerances with...
AbstractA chordal graph is the intersection graph of a family of subtrees of a host tree. In this pa...
AbstractWe prove that a triangle-free graph G is a tolerance graph if and only if there exists a set...
Tolerance graphs have been extensively studied since their introduction, due to their interesting st...
AbstractTolerance graphs have been extensively studied since their introduction, due to their intere...
Tolerance graphs have been extensively studied since their introduction, due to their interesting st...
AbstractWe prove that a triangle-free graph G is a tolerance graph if and only if there exists a set...
AbstractA chordal graph is the intersection graph of a family of subtrees of a host tree. In this pa...
AbstractTolerance graphs have been extensively studied since their introduction, due to their intere...
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree...
AbstractWe establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees ...
AbstractIn this paper, we introduce neighborhood subtree tolerance (NeST) graphs which are defined i...
AbstractA chordal graph is the intersection graph of a family of subtrees of a tree, or, equivalentl...
AbstractA chordal graph is the intersection graph of a family of subtrees of a tree, or, equivalentl...
AbstractWe answer a question of Golumbic, Monma and Trotter by constructing proper tolerance graphs ...
A graph G=(V, E) is a threshold tolerance if it is possible to associate weights and tolerances with...
AbstractA chordal graph is the intersection graph of a family of subtrees of a host tree. In this pa...
AbstractWe prove that a triangle-free graph G is a tolerance graph if and only if there exists a set...
Tolerance graphs have been extensively studied since their introduction, due to their interesting st...
AbstractTolerance graphs have been extensively studied since their introduction, due to their intere...
Tolerance graphs have been extensively studied since their introduction, due to their interesting st...
AbstractWe prove that a triangle-free graph G is a tolerance graph if and only if there exists a set...
AbstractA chordal graph is the intersection graph of a family of subtrees of a host tree. In this pa...
AbstractTolerance graphs have been extensively studied since their introduction, due to their intere...
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree...
DOI
Add to ORKG