M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities (Q534043): Difference between revisions

@@ Property / cites work @@
+\(M\)-alternating paths in \(n\)-extendable bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On defect-d matchings in graphs
@@ Property / cites work: On defect-d matchings in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalization of matching extensions in graphs
@@ Property / cites work: Generalization of matching extensions in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on internally disjoint alternating paths in bipartite graphs
+Normal rank
@@ Property / cites work @@
+On n-extendable graphs
@@ Property / cites work: On n-extendable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3800093
@@ Property / cites work: Q3800093 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple version of Karzanov's blocking flow algorithm
+Normal rank
@@ Property / cites work @@
+Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
+Normal rank
@@ Property / cites work @@
+Q5442535
@@ Property / cites work: Q5442535 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum degree of minimal defect \(n\)-extendable bipartite graphs
+Normal rank
@@ Property / cites work @@
+Construction for bicritical graphs and \(k\)-extendable bipartite graphs
+Normal rank