On Bounds for the k-Partitioning of Graphs (Q4938663)
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: On Bounds for the k-Partitioning of Graphs |
scientific article; zbMATH DE number 1405682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Bounds for the k-Partitioning of Graphs |
scientific article; zbMATH DE number 1405682 |
Statements
On Bounds for the k-Partitioning of Graphs (English)
0 references
29 November 2000
0 references
partitioning of graphs
0 references
isoperimetric problem
0 references
Hamming graphs
0 references
0.9629705
0 references
0.9612313
0 references
0.9605374
0 references
0.95048964
0 references
0 references
0 references
0.9375508
0 references
0.93672967
0 references
