On strict-double-bound numbers of graphs and cut sets (Q5061697): Difference between revisions

@@ Property / cites work @@
+A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2839745
@@ Property / cites work: Q2839745 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4390651
@@ Property / cites work: Q4390651 / rank @@
+Normal rank
@@ Property / cites work @@
+The leafage of a chordal graph
@@ Property / cites work: The leafage of a chordal graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3039403
@@ Property / cites work: Q3039403 / rank @@
+Normal rank
@@ Property / cites work @@
+ON STRICT-DOUBLE-BOUND NUMBERS OF COMPLETE PSEUDO-REGULAR TREES
+Normal rank
@@ Property / cites work @@
+Note on strict-double-bound graphs and numbers
@@ Property / cites work: Note on strict-double-bound graphs and numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Posets with interval upper bound graphs
@@ Property / cites work: Posets with interval upper bound graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The competition-common enemy graph of a digraph
@@ Property / cites work: The competition-common enemy graph of a digraph / rank @@
+Normal rank