Graphs whose edge set can be partitioned into maximum matchings (Q1952710)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs whose edge set can be partitioned into maximum matchings |
scientific article |
Statements
Graphs whose edge set can be partitioned into maximum matchings (English)
0 references
3 June 2013
0 references
Summary: 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.
0 references
Vizing's classification of simple graphs
0 references
edge chromatic index
0 references
edge partition
0 references
maximum mathching
0 references
