On Bounds for the k-Partitioning of Graphs (Q4938663): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-48686-0_15 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1585122980 / rank | |||
Normal rank | |||
Latest revision as of 22:06, 19 March 2024
scientific article; zbMATH DE number 1405682
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
