Highly edge-connected detachments of graphs and digraphs

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. Every edge uν ∈ E corresponds to an edge of H connecting some piece of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2003-05, Vol.43 (1), p.67-77
Hauptverfasser:	Berg, Alex R., Jackson, Bill, Jordán, Tibor
Format:	Artikel
Sprache:	eng
Schlagworte:	detachments directed graphs edge-connectivity
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!