On maximum matchings in cubic graphs with a bounded number of bridge-covering paths (Q3798698)
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: On maximum matchings in cubic graphs with a bounded number of bridge-covering paths |
scientific article; zbMATH DE number 4065040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On maximum matchings in cubic graphs with a bounded number of bridge-covering paths |
scientific article; zbMATH DE number 4065040 |
Statements
On maximum matchings in cubic graphs with a bounded number of bridge-covering paths (English)
0 references
1987
0 references
bridges
0 references
maximum matching
0 references
perfect matching
0 references
0.8587219715118408
0 references
0.8431091904640198
0 references
0.8428018093109131
0 references
0.8391028642654419
0 references
