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

DOI10.1016/S0012-365X(03)00291-7MaRDI QIDQ1422410zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
• scientific article; zbMATH DE number 1187145
• Constrained Edge-Splitting Problems
• An edge-splitting algorithm in planar graphs
• scientific article; zbMATH DE number 1342136

Cites work

• A Reduction Method for Edge-Connectivity in Graphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Edge-Connectivity Augmentation Preserving Simplicity
• Edge-Connectivity Augmentation with Partition Constraints
• scientific article; zbMATH DE number 4103110 (Why is no real title available?)
• scientific article; zbMATH DE number 1187145 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 795223 (Why is no real title available?)
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
• The minimum augmentation of any graph to aK-edge-connected graph

Cited in

(8)

• An edge-splitting algorithm in planar graphs
• Edge-splittings preserving local edge-connectivity of graphs
• Approximate edge splitting
• A New Approach to Splitting-Off
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• Constrained Edge-Splitting Problems
• Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
• Bipartition constrained edge-splitting in directed graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422410)