Graphs whose edge set can be partitioned into maximum matchings
classification
🧮 math.CO
cs.DM
keywords
graphsedgematchingsmaximumpartitionedsimplewhosearticle
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.