Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting the number of perfect matchings in \(K_{5}\)-free graphs |
scientific article |
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
