Characterization of saturated graphs related to pairs of disjoint matchings (Q2135642)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterization of saturated graphs related to pairs of disjoint matchings |
scientific article |
Statements
Characterization of saturated graphs related to pairs of disjoint matchings (English)
0 references
9 May 2022
0 references
maximum 2-edge colorable subgraph problem
0 references
graph decompositions into paths
0 references
graph decompositions into even cycles
0 references
0 references
