Minimal path decomposition of complete bipartite graphs (Q1743479)
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 6859583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal path decomposition of complete bipartite graphs |
scientific article; zbMATH DE number 6859583 |
Statements
Minimal path decomposition of complete bipartite graphs (English)
0 references
13 April 2018
0 references
graphs
0 references
complete bipartite graphs
0 references
decomposition algorithms
0 references
minimal path decomposition
0 references
0 references
0.7923049330711365
0 references
0.7857726812362671
0 references
0.7852075695991516
0 references
0.7793095707893372
0 references
