Approximating the maximum 3-edge-colorable subgraph problem

The NP-Completeness of Edge-Coloring

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

Natural Sciences, Visualization, Color Theory +10

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

A matching problem with side conditions

Gérard Cornuéjols, William R. Pulleyblank · Discrete Mathematics · 1980 · 98 citations

Natural Sciences, Business Economics, Optimization +6

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

Adrian Kosowski · Discrete Applied Mathematics · 2009 · 26 citations

Natural Sciences, Computer Science, Mathematics +12