𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On judicious bisections of graphs

✍ Scribed by Xu, Baogang; Yu, Xingxing

Book ID
122784523
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
536 KB
Volume
106
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bisections of graphs
Bisections of graphs
✍ Lee, Choongbum; Loh, Po-Shen; Sudakov, Benny πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 458 KB
Judicious partitions of graphs
Judicious partitions of graphs
✍ B. BollobΓ‘s; A. D. Scott πŸ“‚ Article πŸ“… 1993 πŸ› Springer Netherlands 🌐 English βš– 474 KB
Balanced judicious bipartitions of graph
Balanced judicious bipartitions of graphs
✍ Baogang Xu; Juan Yan; Xingxing Yu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 149 KB

## Abstract A bipartition of the vertex set of a graph is called __balanced__ if the sizes of the sets in the bipartition differ by at most one. B. BollobΓ‘s and A. D. Scott, Random Struct Alg 21 (2002), 414–430 conjectured that if __G__ is a graph with minimum degree of at least 2 then __V__(__G__)

Judicious partitions of bounded-degree g
Judicious partitions of bounded-degree graphs
✍ B. BollobΓ‘s; A. D. Scott πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 1 views

## Abstract We prove results on partitioning graphs __G__ with bounded maximum degree. In particular, we provide optimal bounds for bipartitions __V__(__G__) = __V__~1~ βˆͺ __V__~2~ in which we minimize {__e__(__V__~1~), __e__(__V__~2~)}. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131–143, 200

On the Graph Bisection Cut Polytope
On the Graph Bisection Cut Polytope
✍ Armbruster, Michael; Helmberg, Christoph; FΓΌgenschuh, Marzena; Martin, Alexander πŸ“‚ Article πŸ“… 2008 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 326 KB