Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455)
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: Counting the number of perfect matchings in Kâ -free graphs |
scientific article; zbMATH DE number 6674141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting the number of perfect matchings in \(K_{5}\)-free graphs |
scientific article; zbMATH DE number 6674141 |
Statements
Counting the number of perfect matchings in \(K_{5}\)-free graphs (English)
0 references
12 January 2017
0 references
perfect matching
0 references
counting
0 references
complexity
0 references
0 references
0 references
0.7997158169746399
0 references
0.7610358595848083
0 references
0.7547594308853149
0 references
