On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs

Measurements of edge-uncolorability

Eckhard Steffen · Discrete Mathematics · 2003 · 43 citations

Approximating the maximum 3-edge-colorable subgraph problem

Roméo Rizzi · Discrete Mathematics · 2008 · 30 citations

Natural Sciences, Mathematics, Combinatorics +11

Parsimonious edge coloring

Michael O. Albertson, Ruth Haas · Discrete Mathematics · 1996 · 22 citations

On the Core of a Graph^†

Frank Harary, Michael D. Plummer · Proceedings of the London Mathematical Society · 1967 · 22 citations · Full text

Natural Sciences, Mathematics, Combinatorics +6

On disjoint matchings in cubic graphs

Vahan Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan · Discrete Mathematics · 2010 · 20 citations · Full text

Natural Sciences, Computer Science, Mathematics +11