Packing three copies of a tree into a complete bipartite graph (Q659792)
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: Packing three copies of a tree into a complete bipartite graph |
scientific article; zbMATH DE number 5999906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing three copies of a tree into a complete bipartite graph |
scientific article; zbMATH DE number 5999906 |
Statements
Packing three copies of a tree into a complete bipartite graph (English)
0 references
24 January 2012
0 references
packing
0 references
bipartite packing
0 references
embedding
0 references
0.8914117813110352
0 references
0.8903138637542725
0 references
0.8741504549980164
0 references
0.8624373078346252
0 references
0.8624373078346252
0 references
