Edge-coloring of 3-uniform hypergraphs (Q729801): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2016.06.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2493458272
@@ Property / OpenAlex ID: W2493458272 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3983098
@@ Property / cites work: Q3983098 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+NP completeness of the edge precoloring extension problem on bipartite graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+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 @@
+Q4832864
@@ Property / cites work: Q4832864 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic behavior of the chromatic index for hypergraphs
+Normal rank
@@ Property / cites work @@
+An \(0(n^{1.5})\) algorithm to color proper circular arcs
+Normal rank
@@ Property / cites work @@
+An O(qn) algorithm to q-color a proper family of circular arcs
+Normal rank