A characterization of signed graphs with generalized perfect elimination orderings (Q965961): Difference between revisions

@@ Property / cites work @@
+Signed-eliminable graphs and free multiplicities on the braid arrangement
+Normal rank
@@ Property / cites work @@
+Q2707460
@@ Property / cites work: Q2707460 / rank @@
+Normal rank
@@ Property / cites work @@
+How is a chordal graph like a supersolvable binary matroid?
+Normal rank
@@ Property / cites work @@
+Q3374865
@@ Property / cites work: Q3374865 / rank @@
+Normal rank
@@ Property / cites work @@
+Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chordally signed graphs
@@ Property / cites work: Chordally signed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003206
@@ Property / cites work: Q4003206 / 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 @@
+Supersolvable lattices
@@ Property / cites work: Supersolvable lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Supersolvable frame-matroid and graphic-lift lattices
+Normal rank
@@ Property / cites work @@
+The Geometry of Root Systems and Signed Graphs
@@ Property / cites work: The Geometry of Root Systems and Signed Graphs / rank @@
+Normal rank