Graphs whose edge set can be partitioned into maximum matchings (Q1952710): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2083246313 / rank | |||
Normal rank |
Revision as of 20:31, 19 March 2024
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