Judicious partitions of bounded-degree graphs

Abstract

We prove results on partitioning graphs G with bounded maximum degree. In particular, we provide optimal bounds for bipartitions V(G)= V1 ∪ V2 in which we minimize max{e(V1), e(V2)}. © 2004 Wiley Periodicals, Inc.