The forbidden minor characterization of line-search antimatroids of rooted digraphs (Q1410699): Difference between revisions

@@ Property / cites work @@
+An algorithmic characterization of antimatroids
@@ Property / cites work: An algorithmic characterization of antimatroids / rank @@
+Normal rank
@@ Property / cites work @@
+Meet-distributive lattices and the anti-exchange closure
+Normal rank
@@ Property / cites work @@
+Minor characterization of undirected branching greedoids -- a short proof
+Normal rank
@@ Property / cites work @@
+Q3940405
@@ Property / cites work: Q3940405 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3338268
@@ Property / cites work: Q3338268 / rank @@
+Normal rank
@@ Property / cites work @@
+Polymatroid greedoids
@@ Property / cites work: Polymatroid greedoids / rank @@
+Normal rank
@@ Property / cites work @@
+Greedoids
@@ Property / cites work: Greedoids / rank @@
+Normal rank
@@ Property / cites work @@
+Q5708605
@@ Property / cites work: Q5708605 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4867717
@@ Property / cites work: Q4867717 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of undirected branching greedoids
+Normal rank
@@ Property / cites work @@
+A labeling algorithm to recognize a line digraph and output its root graph
+Normal rank