𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of edge-disjoint 2-connected spanning subgraphs

✍ Scribed by Tibor Jordán

Book ID
108167385
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
163 KB
Volume
95
Category
Article
ISSN
0095-8956

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