Greedy colorings of uniform hypergraphs (Q3055773): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/rsa.20267
@@ Property / full work available at URL: https://doi.org/10.1002/rsa.20267 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4254640110
@@ Property / OpenAlex ID: W4254640110 / rank @@
+Normal rank
@@ Property / cites work @@
+Every 8-uniform 8-regular hypergraph is 2-colorable
+Normal rank
@@ Property / cites work @@
+On 3-chromatic hypergraphs
@@ Property / cites work: On 3-chromatic hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring uniform hypergraphs with few colors
@@ Property / cites work: Coloring uniform hypergraphs with few colors / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds and algorithms for hypergraph 2-coloring
+Normal rank
@@ Property / cites work @@
+Ein kombinatorisches Problem von P. Erdős und A. Hajnal
+Normal rank
@@ Property / cites work @@
+Coloring n-sets red and blue
@@ Property / cites work: Coloring n-sets red and blue / rank @@
+Normal rank
@@ Property / cites work @@
+The Even Cycle Problem for Directed Graphs
@@ Property / cites work: The Even Cycle Problem for Directed Graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3055773