A new lower bound on the number of perfect matchings in cubic graphs (Q3583319)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5775368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound on the number of perfect matchings in cubic graphs |
scientific article; zbMATH DE number 5775368 |
Statements
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs (English)
0 references
27 August 2010
0 references
perfect matching
0 references
cubic graph
0 references
brick and brace decomposition
0 references
perfect matching polytope
0 references
0.951698124408722
0 references
0.8914617300033569
0 references
0.8807163834571838
0 references
0.8753774762153625
0 references
0.875044047832489
0 references
