On k-partitioning of Hamming graphs

DOI10.1016/S0166-218X(99)00070-0MaRDI QIDQ1302152zbMATH OpenOpenAlexWikidataFDO

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

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

graph partitioninghypercubesHamming 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)

Recommendations

• On Bounds for the k-Partitioning of Graphs
• scientific article; zbMATH DE number 2032361
• On a problem of judicious \(k\)-partitions of graphs
• Judicious partitions of graphs
• Graph partitions. II

Cited in

(6)

• From connectivity to coloring
• scientific article; zbMATH DE number 3916306 (Why is no real title available?)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• A Bound on Equitable Partitions of the Hamming Space
• scientific article; zbMATH DE number 2032361 (Why is no real title available?)
• On \(k\)-partitioning the \(n\)-cube

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302152)