On \(k\)-partitioning of Hamming graphs

DOI10.1016/S0166-218X(99)00070-0zbMath0934.05101OpenAlexW2037594260WikidataQ127646775 ScholiaQ127646775MaRDI QIDQ1302152

U.-P. Schroeder, Robert Elsässer, Sergei L. Bezrukov

Publication date: 9 April 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00070-0

zbMATH Keywords

hypercubesgraph partitioningHamming graphsedge-isoperimetric problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

This page was built for publication: On \(k\)-partitioning of Hamming graphs