Neighborhood subtree tolerance graphs

DOI10.1016/0166-218X(93)90165-KzbMath0788.05083OpenAlexW2077615138MaRDI QIDQ1801665

P. M. Dearing, Eric Bibelnieks

Publication date: 17 August 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90165-k

zbMATH Keywords

tolerance graphsintersection graphs

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items (13)

NeST graphs ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Towards a characterization of leaf powers by clique arrangements ⋮ Characterizing width two for variants of treewidth ⋮ Skew rank decompositions ⋮ Recognition of linear and star variants of leaf powers is in P ⋮ Pairwise compatibility graphs: complete characterization for wheels ⋮ Rooted directed path graphs are leaf powers ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ Exact leaf powers ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ Simplicial powers of graphs ⋮ Simplicial Powers of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Tolerance graphs
• Weakly triangulated graphs
• Characterizations of strongly chordal graphs
• Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• A Class of Balanced Matrices Arising from Location Problems
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
• Threshold tolerance graphs
• General results on tolerance intersection graphs

This page was built for publication: Neighborhood subtree tolerance graphs