Supersolvable saturated matroids and chordal graphs (Q6144421): Difference between revisions

@@ Property / cites work @@
+Q5603088
@@ Property / cites work: Q5603088 / rank @@
+Normal rank
@@ Property / cites work @@
+How is a chordal graph like a supersolvable binary matroid?
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid tree-width
@@ Property / cites work: Matroid tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Q5390304
@@ Property / cites work: Q5390304 / rank @@
+Normal rank
@@ Property / cites work @@
+Supersolvable lattices
@@ Property / cites work: Supersolvable lattices / rank @@
+Normal rank