The enumeration of perfect matchings in two types of graphs (Q2927385)
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 6365330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The enumeration of perfect matchings in two types of graphs |
scientific article; zbMATH DE number 6365330 |
Statements
3 November 2014
0 references
perfect matching
0 references
linear recurrence relation
0 references
characteristic equation
0 references
0.97353035
0 references
0.95500594
0 references
0.94313407
0 references
0.9426005
0 references
0.9405478
0 references
0.9380523
0 references
The enumeration of perfect matchings in two types of graphs (English)
0 references
