On the forced matching numbers of bipartite graphs (Q1827691): Difference between revisions

@@ Property / cites work @@
+Q4552244
@@ Property / cites work: Q4552244 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4846495
@@ Property / cites work: Q4846495 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3869366
@@ Property / cites work: Q3869366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum number of blocks defining a design
@@ Property / cites work: On the minimum number of blocks defining a design / rank @@
+Normal rank
@@ Property / cites work @@
+Q3715120
@@ Property / cites work: Q3715120 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4887804
@@ Property / cites work: Q4887804 / rank @@
+Normal rank
@@ Property / cites work @@
+Forcing numbers of stop signs.
@@ Property / cites work: Forcing numbers of stop signs. / rank @@
+Normal rank
@@ Property / cites work @@
+Defining sets in vertex colorings of graphs and latin rectangles
+Normal rank
@@ Property / cites work @@
+Q4359574
@@ Property / cites work: Q4359574 / rank @@
+Normal rank
@@ Property / cites work @@
+Forcing matchings on square grids
@@ Property / cites work: Forcing matchings on square grids / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum forcing number for the torus and hypercube
+Normal rank
@@ Property / cites work @@
+Q4858978
@@ Property / cites work: Q4858978 / rank @@
+Normal rank