𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of partitioning graphs into connected subgraphs

✍ Scribed by M.E. Dyer; A.M. Frieze

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
897 KB
Volume
10
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On partitioning interval graphs into pro
On partitioning interval graphs into proper interval subgraphs and related problems
✍ FrΓ©dΓ©ric Gardi πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

In this paper, we establish that any interval graph (resp. circulararc graph) with n vertices admits a partition into at most log 3 n (resp. log 3 n +1) proper interval subgraphs, for n>1. The proof is constructive and provides an efficient algorithm to compute such a partition. On the other hand, t

Spanning subgraphs of graphs partitioned
Spanning subgraphs of graphs partitioned into two isomorphic pieces
✍ Anthony Bonato πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 124 KB

## Abstract A graph has the neighbor‐closed‐co‐neighbor, or ncc property, if for each of its vertices __x__, the subgraph induced by the neighbor set of __x__ is isomorphic to the subgraph induced by the closed non‐neighbor set of __x__. As proved by Bonato and Nowakowski [5], graphs with the ncc p

Max-min partitioning of grid graphs into
Max-min partitioning of grid graphs into connected components
✍ Becker, Ronald; Lari, Isabella; Lucertini, Mario; Simeone, Bruno πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 197 KB πŸ‘ 2 views

The partitioning of a rectangular grid graph with weighted vertices into p connected components such that the component of smallest weight is as heavy as possible (the max-min problem) is considered. It is shown that the problem is NP-hard for rectangles with at least three rows. A shifting algorith