An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437): Difference between revisions

@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of strongly chordal graphs
@@ Property / cites work: Characterizations of strongly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On brittle graphs
@@ Property / cites work: On brittle graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding houses and holes in graphs
@@ Property / cites work: Finding houses and holes in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the semi-perfect elimination
@@ Property / cites work: On the semi-perfect elimination / rank @@
+Normal rank
@@ Property / cites work @@
+Doubly Lexical Orderings of Matrices
@@ Property / cites work: Doubly Lexical Orderings of Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of recognizing perfectly orderable graphs
+Normal rank
@@ Property / cites work @@
+Q5387667
@@ Property / cites work: Q5387667 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank