The complexity of arc-colorings for directed hypergraphs

The NP-Completeness of Edge-Coloring

Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations

Natural Sciences, Visualization, Color Theory +10

Introduction to the Theory of Complexity.

V. J. Rayward‐Smith, Daniel P. Bovet, Pierluigi Crescenzi · Journal of the Operational Research Society · 1995 · 248 citations

Computing, Computer Science, Mathematics +10

Minimal Representation of Directed Hypergraphs

Giorgio Ausiello, Aurora D’Atri, Domenico Saccà · SIAM Journal on Computing · 1986 · 104 citations

Natural Sciences, Computer Science, Mathematics +12

Using euler partitions to edge color bipartite multigraphs

Harold N. Gabow · International Journal of Parallel Programming · 1976 · 94 citations

Natural Sciences, High-performance Computing, Combinatorics +9

On the orientation of graphs and hypergraphs

András Frank, Tamás Király, Zoltán Király · Discrete Applied Mathematics · 2003 · 81 citations

Natural Sciences, Computer Science, Mathematics +9