Wirelength of embedding complete multipartite graphs into certain graphs (Q2181259): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2018.05.034 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129599249 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2018.05.034 / rank | |||
Normal rank | |||
Latest revision as of 09:18, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Wirelength of embedding complete multipartite graphs into certain graphs |
scientific article |
Statements
Wirelength of embedding complete multipartite graphs into certain graphs (English)
0 references
18 May 2020
0 references
embedding
0 references
congestion
0 references
wirelength
0 references
complete multipartite graph
0 references
path
0 references
cycle
0 references
wheel
0 references
hypertree
0 references
cylinder
0 references
torus
0 references
circulant graph
0 references
0 references
