Graphs Whose Edge Set Can Be Partitioned into Maximum Matchings
Niraj Khare · ISRN Combinatorics · 2013
This paper 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.