Neighborhood subtree tolerance graphs
From MaRDI portal
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.
Cites work
- A Class of Balanced Matrices Arising from Location Problems
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- Characterizations of strongly chordal graphs
- Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
- General results on tolerance intersection graphs
- scientific article; zbMATH DE number 3853140 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 867635 (Why is no real title available?)
- The edge intersection graphs of paths in a tree
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Threshold tolerance graphs
- Tolerance graphs
- Weakly triangulated graphs
Cited in
(14)- Simplicial powers of graphs
- NeST graphs
- Skew rank decompositions
- Pairwise compatibility graphs: complete characterization for wheels
- Pairwise compatibility graphs: a survey
- Characterizing width two for variants of treewidth
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Simplicial Powers of Graphs
- Recognition of linear and star variants of leaf powers is in P
- Lower bounds for leaf rank of leaf powers
- Rooted directed path graphs are leaf powers
- Characterising \((k,\ell )\)-leaf powers
- Exact leaf powers
This page was built for publication: Neighborhood subtree tolerance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801665)
