Neighborhood subtree tolerance graphs (Q1801665): Difference between revisions

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.

0 references

zbMATH Keywords

intersection graphs

0 references

tolerance graphs

0 references

reviewed by

Peter Kirschenhofer

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices

0 references

Characterizations of strongly chordal graphs

0 references

The intersection graphs of subtrees in trees are exactly the chordal graphs

0 references

Q3328583

0 references

The edge intersection graphs of paths in a tree

0 references

Q3322150

0 references

Tolerance graphs

0 references

Weakly triangulated graphs

0 references

Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]

0 references

Q4873748

0 references

General results on tolerance intersection graphs

0 references

Threshold tolerance graphs

0 references

A Class of Balanced Matrices Arising from Location Problems

0 references

full work available at URL

https://doi.org/10.1016/0166-218x(93)90165-k

0 references

Identifiers

zbMATH Open document ID

0788.05083

0 references

DOI

10.1016/0166-218X(93)90165-K

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1801665

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
+Normal rank
@@ Property / cites work @@
+Characterizations of strongly chordal graphs
@@ Property / cites work: Characterizations of strongly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge intersection graphs of paths in a tree
@@ Property / cites work: The edge intersection graphs of paths in a tree / rank @@
+Normal rank
@@ Property / cites work @@
+Q3322150
@@ Property / cites work: Q3322150 / rank @@
+Normal rank
@@ Property / cites work @@
+Tolerance graphs
@@ Property / cites work: Tolerance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
+Normal rank
@@ Property / cites work @@
+Q4873748
@@ Property / cites work: Q4873748 / rank @@
+Normal rank
@@ Property / cites work @@
+General results on tolerance intersection graphs
@@ Property / cites work: General results on tolerance intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold tolerance graphs
@@ Property / cites work: Threshold tolerance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Class of Balanced Matrices Arising from Location Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(93)90165-k
+Normal rank
@@ Property / OpenAlex ID @@
+W2077615138
@@ Property / OpenAlex ID: W2077615138 / rank @@
+Normal rank