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 {e(V1), e(V2)}. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131–143, 2004
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Apr 07, 2004
- Source ID
- 10.1002/jgt.10174
Entities
People
- A. D. Scott
- B. Bollobas
Organizations
- Defense Advanced Research Projects Agency
- National Science Foundation