On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring Steiner quadruple systems
@@ Property / cites work: Colouring Steiner quadruple 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 @@
+On chromatic number of graphs and set-systems
@@ Property / cites work: On chromatic number of graphs and set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+Endliche Vervollständigung endlicher partieller Steinerscher Systeme. (Finite completion of finite partial Steiner systems)
+Normal rank
@@ Property / cites work @@
+Finite partial quadruple systems can be finitely embedded
+Normal rank
@@ Property / cites work @@
+The Complexity of Near-Optimal Graph Coloring
@@ Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2718910
@@ Property / cites work: Q2718910 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
+Normal rank
@@ Property / cites work @@
+A Survey of Embedding Theorems for Steiner Systems
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+Near vector spaces over GF(q) and (v,q + 1,1) BIBDs
+Normal rank
@@ Property / cites work @@
+The completion of finite incomplete Steiner triple systems with applications to loop theory
+Normal rank
@@ Property / cites work @@
+Coloring Block Designs is NP-Complete
@@ Property / cites work: Coloring Block Designs is NP-Complete / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02579160
+Normal rank
@@ Property / OpenAlex ID @@
+W2049432567
@@ Property / OpenAlex ID: W2049432567 / rank @@
+Normal rank