Approximating the maximum 2- and 3-edge-colorable subgraph problems

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text

Computing, Computer Science, Mathematics +13

The NP-Completeness of Edge-Coloring

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

Natural Sciences, Visualization, Color Theory +10

An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

Harold N. Gabow · 1983 · 248 citations

Computing, Computer Science, Algorithms +11

NP completeness of finding the chromatic index of regular graphs

Daniel Leven, Zvi Galil · Journal of Algorithms · 1983 · 191 citations

Natural Sciences, Visualization, Combinatorics +6

A constructive proof of Vizing's theorem

Jayadev Misra, David Gries · Information Processing Letters · 1992 · 180 citations

Computing, Computer Science, Mathematics +5