Counting perfect matchings in \(n\)-extendable graphs (Q2483418)
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 perfect matchings in n-extendable graphs |
scientific article; zbMATH DE number 5268477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting perfect matchings in \(n\)-extendable graphs |
scientific article; zbMATH DE number 5268477 |
Statements
Counting perfect matchings in \(n\)-extendable graphs (English)
0 references
28 April 2008
0 references
\(n\)-extendable graph
0 references
perfect matching
0 references
enumeration
0 references
0.8304447531700134
0 references
0.8192498087882996
0 references
0.8127604722976685
0 references
