Embedding partial Steiner triple systems is NP-complete (Q787671): Difference between revisions

@@ Property / cites work @@
+Embedding Partial Steiner Triple Systems
@@ Property / cites work: Embedding Partial Steiner Triple Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Completing small partial triple systems
@@ Property / cites work: Completing small partial triple systems / rank @@
+Normal rank
@@ Property / cites work @@
+On embedding incomplete symmetric Latin squares
@@ Property / cites work: On embedding incomplete symmetric Latin squares / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A Survey of Embedding Theorems for Steiner Systems
+Normal rank
@@ Property / cites work @@
+Q4137190
@@ Property / cites work: Q4137190 / rank @@
+Normal rank
@@ Property / cites work @@
+Systems of Distinct Representatives
@@ Property / cites work: Systems of Distinct Representatives / rank @@
+Normal rank
@@ Property / cites work @@
+Premature sets of 1-factors or how not to schedule round robin tournaments
+Normal rank
@@ Property / cites work @@
+The completion of finite incomplete Steiner triple systems with applications to loop theory
+Normal rank