Decomposition of bipartite graphs into spiders all of whose legs are two in length. (Q2936670)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposition of bipartite graphs into spiders all of whose legs are two in length. |
scientific article; zbMATH DE number 6383818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition of bipartite graphs into spiders all of whose legs are two in length. |
scientific article; zbMATH DE number 6383818 |
Statements
6 January 2015
0 references
decomposition
0 references
complete bipartite graph
0 references
crown
0 references
spider
0 references
0.7586963772773743
0 references
0.7518309354782104
0 references
0.7512370347976685
0 references
