  This article provides structural characterization of simple graphs whose
edge-set can be partitioned into maximum matchings. We use Vizing's
classification of simple graphs based on edge chromatic index.
