The strong chromatic number of partial triple systems (Q1101122): Difference between revisions

@@ Property / cites work @@
+Q3686719
@@ Property / cites work: Q3686719 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding partial Steiner triple systems is NP-complete
+Normal rank
@@ Property / cites work @@
+Q3728912
@@ Property / cites work: Q3728912 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring Block Designs is NP-Complete
@@ Property / cites work: Coloring Block Designs is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Quadratic leaves of maximal partial triple systems
+Normal rank
@@ Property / cites work @@
+Q3728911
@@ Property / cites work: Q3728911 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring Steiner Triple Systems
@@ Property / cites work: Coloring Steiner Triple Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+NP completeness of finding the chromatic index of regular graphs
+Normal rank
@@ Property / cites work @@
+Q5181736
@@ Property / cites work: Q5181736 / rank @@
+Normal rank
@@ Property / cites work @@
+On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
+Normal rank
@@ Property / cites work @@
+Q5680138
@@ Property / cites work: Q5680138 / rank @@
+Normal rank