On the forced matching numbers of bipartite graphs (Q1827691)
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 2083655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the forced matching numbers of bipartite graphs |
scientific article; zbMATH DE number 2083655 |
Statements
On the forced matching numbers of bipartite graphs (English)
0 references
6 August 2004
0 references
Forcing number
0 references
Matching in graphs
0 references
Unique matchings
0 references
Hypercubes
0 references
0.8597796559333801
0 references
0.8592134714126587
0 references
0.8589177131652832
0 references
0.8457080721855164
0 references
0.8347296118736267
0 references
