The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634): 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.1007/978-3-642-16926-7_28
+Normal rank
@@ Property / OpenAlex ID @@
+W1571652254
@@ Property / OpenAlex ID: W1571652254 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4830805
@@ Property / cites work: Q4830805 / rank @@
+Normal rank
@@ Property / cites work @@
+Supersaturated graphs and hypergraphs
@@ Property / cites work: Supersaturated graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum size of 3-uniform hypergraphs not containing a Fano plane
+Normal rank
@@ Property / cites work @@
+The complexity of colouring problems on dense graphs
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+The Complexity of Perfect Matching Problems on Dense Hypergraphs
+Normal rank
@@ Property / cites work @@
+Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+An expected polynomial time algorithm for coloring 2-colorable 3-graphs
+Normal rank
@@ Property / cites work @@
+Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
+Normal rank
@@ Property / cites work @@
+A Dirac-Type Theorem for 3-Uniform Hypergraphs
@@ Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings in large uniform hypergraphs with large minimum collective degree
+Normal rank
@@ Property / cites work @@
+The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
+Normal rank