Graphs whose edge set can be partitioned into maximum matchings
Niraj Khare
TL;DR
This paper characterizes simple graphs that can have their edges partitioned into maximum matchings, utilizing Vizing's classification based on edge chromatic index.
Contribution
It offers a structural characterization of such graphs, connecting maximum matchings with Vizing's classification.
Findings
Provides a structural characterization of graphs with edges partitionable into maximum matchings
Utilizes Vizing's classification to analyze graph properties
Establishes conditions for graphs to be partitioned into maximum matchings
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Graph theory and applications