A new lower bound for the number of perfect matchings of line graph (Q477656)
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: A new lower bound for the number of perfect matchings of line graph |
scientific article; zbMATH DE number 6378668
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound for the number of perfect matchings of line graph |
scientific article; zbMATH DE number 6378668 |
Statements
A new lower bound for the number of perfect matchings of line graph (English)
0 references
9 December 2014
0 references
combinatorial problems
0 references
enumeration
0 references
perfect matching
0 references
line graph
0 references
2-connected graph
0 references
0.8733698725700378
0 references
0.8687057495117188
0 references
0.8518416285514832
0 references
0.7911407947540283
0 references
0.786548376083374
0 references
