Graphs whose edge set can be partitioned into maximum matchings

2012/10/17 by Khare, Niraj
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.1210.4710

Abstract

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.

Related

• Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size
• Colour-bias perfect matchings in hypergraphs
• Decomposition of class II graphs into two class I graphs
• Partitioning edges of a planar graph into linear forests and a matching
• Characterizing graphs of maximum matching width at most 2