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

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2004.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2175737271
@@ Property / OpenAlex ID: W2175737271 / 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 @@
+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 @@
+On the orientation of graphs and hypergraphs
@@ Property / cites work: On the orientation of graphs and hypergraphs / 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