Characterization of saturated graphs related to pairs of disjoint matchings (Q2135642)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterization of saturated graphs related to pairs of disjoint matchings |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9156892895698548
0 references
0.8346052765846252
0 references
0.8306843638420105
0 references
0.8077822327613831
0 references
0.7847765684127808
0 references
