𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning a graph into the minimal number of complete subgraphs

✍ Scribed by A. P. Ryzhkov

Publisher
Springer US
Year
1976
Tongue
English
Weight
557 KB
Volume
11
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On partitioning the edges of graphs into
On partitioning the edges of graphs into connected subgraphs
✍ M. JΓΌnger; G. Reinelt; W. R. Pulleyblank πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 559 KB

For any positive integer s, an s-partition of a graph G = ( ! -( €I is a partition of E into El U E2 U U E k, where 14 = s for 1 I i 5 k -1 and 1 5 1 4 1 5 s and each €; induces a connected subgraph of G. We prove (i) if G is connected, then there exists a 2-partition, but not neces-(ii) if G is 2-e