Factor-critical graphs with the minimum number of near-perfect matchings (Q2515569)
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: Factor-critical graphs with the minimum number of near-perfect matchings |
scientific article; zbMATH DE number 6470566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factor-critical graphs with the minimum number of near-perfect matchings |
scientific article; zbMATH DE number 6470566 |
Statements
Factor-critical graphs with the minimum number of near-perfect matchings (English)
0 references
5 August 2015
0 references
matching
0 references
factor-critical
0 references
near-perfect matching
0 references
0.8929145336151123
0 references
0.8808827996253967
0 references
0.8685038685798645
0 references
0.8576590418815613
0 references
