The complexity of arc-colorings for directed hypergraphs (Q5899364): Difference between revisions

@@ Property / OpenAlex ID @@
+W2031027508
@@ Property / OpenAlex ID: W2031027508 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Representation of Directed Hypergraphs
@@ Property / cites work: Minimal Representation of Directed Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448373
@@ Property / cites work: Q4448373 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4099676
@@ Property / cites work: Q4099676 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Cayley Digraphs Based on the de Bruijn Networks
@@ Property / cites work: Cayley Digraphs Based on the de Bruijn Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Using euler partitions to edge color bipartite multigraphs
+Normal rank
@@ Property / cites work @@
+Directed hypergraphs and applications
@@ Property / cites work: Directed hypergraphs and applications / 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 @@
+Q3976640
@@ Property / cites work: Q3976640 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5492575
@@ Property / cites work: Q5492575 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of arc-colorings for directed hypergraphs
+Normal rank