The decomposition threshold for bipartite graphs with minimum degree one (Q4803312)
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 1891623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The decomposition threshold for bipartite graphs with minimum degree one |
scientific article; zbMATH DE number 1891623 |
Statements
The decomposition threshold for bipartite graphs with minimum degree one (English)
0 references
2 April 2003
0 references
\(H\)-packing
0 references
\(H\)-decomposition
0 references
bipartite graph
0 references
minimum degree
0 references
0.8421328067779541
0 references
0.8216986656188965
0 references
0.8193773031234741
0 references
0.8153067231178284
0 references
