On Partitioning the Edges of Graphs into Connected Subgraphs
Jünger, Michael and Reinelt, Gerhard and Pulleyblank, William R.
(1985)
On Partitioning the Edges of Graphs into Connected Subgraphs.
Published in:
Journal of Graph Theory Vol. 9 (4).
pp. 539549.
Abstract
For any positive integer s, an spartition of a graph G = (V, E) is a partition of E into E1 E2 Ek, where Ei = s for 1 i k  1 and 1 Ek s and each Ei induces a connected subgraph of G. We prove (i) If G is connected, then there exists a 2partition, but not necessarily a 3partition; (ii) If G is 2edge connected, then there exists a 3partition, but not necessarily a 4partition; (iii) If G is 3edge connected, then there exists a 4partition; (iv) If G is 4edge connected, then there exists an spartition for all s.
Item Type:  Article 

Citations:  No citation data. 
Uncontrolled Keywords:  
Subjects: 

Divisions:  Institute of Computer Science > Computer Science Department  Prof. Dr. Juenger 
Related URLs: 
ZAIK Number:  UNSPECIFIED 

Depositing User:  Archive Admin 
Date Deposited:  31 Aug 2010 14:50 
Last Modified:  04 Jul 2014 09:34 
URI:  http://earchive.informatik.unikoeln.de/id/eprint/817 