Highly edge-connected detachments of graphs and digraphs

DOI10.1002/jgt.10104zbMath1014.05043OpenAlexW2604311289MaRDI QIDQ4808407

Alex R. Berg, Bill Jackson, Tibor Jordán

Publication date: 22 May 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10104

zbMATH Keywords

digraphsedge-connectivitydetachments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (7)

Multiply balanced edge colorings of multigraphs ⋮ Edge splitting and connectivity augmentation in directed hypergraphs. ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ A detachment algorithm for inferring a graph from path frequency ⋮ Eulerian detachments with local edge-connectivity ⋮ Orientations and detachments of graphs with prescribed degrees and connectivity ⋮ Some Theorems on Detachments Preserving Local-Edge-Connectivity

Cites Work

• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Non-Separable Detachments of Graphs
• Connected Detachments of Graphs and Generalized Euler Trails
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• A Reduction Method for Edge-Connectivity in Graphs
• Detachments Preserving Local Edge-Connectivity of Graphs
• Detachment of Vertices of Graphs Preserving Edge-Connectivity

This page was built for publication: Highly edge-connected detachments of graphs and digraphs