Q4229266 (Q4229266): Difference between revisions

@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a matrix to be totally unimodular
+Normal rank
@@ Property / cites work @@
+Structural properties and recognition of restricted and strongly unimodular matrices
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / 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 @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
@@ Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of ptolemaic graphs
@@ Property / cites work: A characterization of ptolemaic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Neighborhood perfect graphs
@@ Property / cites work: Neighborhood perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy of totally unimodular matrices
@@ Property / cites work: A hierarchy of totally unimodular matrices / rank @@
+Normal rank
@@ Property / cites work @@
+New linear time algorithms for generating perfect elimination orderings of chordal graphs
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+On a Class of Totally Unimodular Matrices
@@ Property / cites work: On a Class of Totally Unimodular Matrices / rank @@
+Normal rank