𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-decompositions of highly connected graphs into

✍ Scribed by Carsten Thomassen

Publisher
Vandenhoeck & Ruprecht
Year
2008
Tongue
German
Weight
263 KB
Volume
78
Category
Article
ISSN
0025-5858

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decompositions of highly connected graph
Decompositions of highly connected graphs into paths of length 3
✍ Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

## Abstract We prove that a 171‐edge‐connected graph has an edge‐decomposition into paths of length 3 if and only its size is divisible by 3. It is a long‐standing problem whether 2‐edge‐connectedness is sufficient for planar triangle‐free graphs, and whether 3‐edge‐connectedness suffices for graph

Highly edge-connected detachments of gra
Highly edge-connected detachments of graphs and digraphs
✍ Alex R. Berg; Bill Jackson; Tibor Jordán 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract Let __G__ = (__V__,__E__) be a graph or digraph and __r__ : __V__ → __Z__~+~. An __r__‐detachment of __G__ is a graph __H__ obtained by ‘splitting’ each vertex ν ∈ __V__ into __r__(ν) vertices. The vertices ν~1~,…,ν~__r__(ν)~ obtained by splitting ν are called the __pieces__ of ν in __H

Decompositions of Edge-Colored Complete
Decompositions of Edge-Colored Complete Graphs
✍ Esther R. Lamken; Richard M. Wilson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We prove an asymptotic existence theorem for decompositions of edge-colored complete graphs into prespecified edge-colored subgraphs. Many combinatorial design problems fall within this framework. Applications of our main theorem require calculations involving the numbers of edges of each color and

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