An Excluded Minor Characterization of Seymour Graphs (Q3009746): Difference between revisions

@@ Property / cites work @@
+A characterization of Seymour graphs
@@ Property / cites work: A characterization of Seymour graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On shortest \(T\)-joins and packing \(T\)-cuts
@@ Property / cites work: On shortest \(T\)-joins and packing \(T\)-cuts / rank @@
+Normal rank
@@ Property / cites work @@
+-Matchings and 2-covers of hypergraphs
@@ Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the disjoint paths problem
@@ Property / cites work: On the complexity of the disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519709
@@ Property / cites work: Q5519709 / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected distances and the postman-structure of graphs
+Normal rank
@@ Property / cites work @@
+The matroids with the max-flow min-cut property
@@ Property / cites work: The matroids with the max-flow min-cut property / rank @@
+Normal rank
@@ Property / cites work @@
+On Odd Cuts and Plane Multicommodity Flows
@@ Property / cites work: On Odd Cuts and Plane Multicommodity Flows / rank @@
+Normal rank