Neighborhood subtree tolerance graphs

DOI10.1016/0166-218X(93)90165-KzbMATH Open0788.05083OpenAlexW2077615138MaRDI QIDQ1801665FDOQ1801665

Authors: Eric Bibelnieks, P. M. Dearing 

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

intersection graphstolerance graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Title not available (Why is that?)
• Recognition of linear and star variants of leaf powers is in P
• NeST graphs
• Exact leaf powers
• Simplicial powers of graphs
• Pairwise compatibility graphs: a survey
• Characterising \((k,\ell )\)-leaf powers
• Skew rank decompositions
• Characterizing width two for variants of treewidth
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• Simplicial Powers of Graphs
• Rooted directed path graphs are leaf powers
• Pairwise compatibility graphs: complete characterization for wheels

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)