A class of `matching-equivalent' bipartite graphs (Q1301665)
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 1334486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of `matching-equivalent' bipartite graphs |
scientific article; zbMATH DE number 1334486 |
Statements
A class of `matching-equivalent' bipartite graphs (English)
0 references
13 March 2000
0 references
\(r\)-matchings
0 references
bipartite graphs
0 references
matching-equivalent
0 references
rook polynomial
0 references
0.8683307766914368
0 references
0.8365339636802673
0 references
0.8320565223693848
0 references
