Graphs whose edge set can be partitioned into maximum matchings (Q1952710): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar graphs of maximum degree seven are Class I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4869540 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the chromatic index of almost all graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs with restricted valency and matching number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degrees and matchings / rank | |||
Normal rank | |||
Latest revision as of 11:17, 6 July 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
