On Bounds for the k-Partitioning of Graphs

DOI10.1007/3-540-48686-0_15zbMath0949.05042OpenAlexW1585122980MaRDI QIDQ4938663

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

Publication date: 29 November 2000

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-48686-0_15

zbMATH Keywords

isoperimetric problemHamming graphspartitioning of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

This page was built for publication: On Bounds for the k-Partitioning of Graphs