Splitting off edges between two subsets preserving the edge-connectivity of the graph.

DOI10.1016/S0012-365X(03)00291-7zbMath1039.05037OpenAlexW2058149194MaRDI QIDQ1422410

Tibor Jordán, Jörgen Bang-Jensen

Publication date: 14 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00291-7

zbMATH Keywords

edge-connectivity augmentationpartition constrained augmentationsplit completion problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• The minimum augmentation of any graph to aK-edge-connected graph
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• A Reduction Method for Edge-Connectivity in Graphs
• Edge-Connectivity Augmentation Preserving Simplicity
• Edge-Connectivity Augmentation with Partition Constraints
• Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

This page was built for publication: Splitting off edges between two subsets preserving the edge-connectivity of the graph.