𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact Bounds for Judicious Partitions of Graphs

✍ Scribed by B. Bollobás; A. D. Scott

Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
223 KB
Volume
19
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Judicious partitions of graphs
Judicious partitions of graphs
✍ B. Bollobás; A. D. Scott 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 474 KB
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

Partitioning Graphs of Bounded Tree-Widt
Partitioning Graphs of Bounded Tree-Width
✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 199 KB
Sharp bounds for decompositions of graph
Sharp bounds for decompositions of graphs into completer-partite subgraphs
✍ Gregory, David A.; Vander Meulen, Kevin N. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 435 KB 👁 2 views

If G is a graph on n vertices and r 2 2, w e let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), w e may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w