Edge-splittings preserving local edge-connectivity of graphs

DOI10.1016/J.DAM.2007.05.046MaRDI QIDQ2482096zbMATH OpenOpenAlexFDO

Authors Zoltán Szigeti

Publication date 16 April 2008

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

Full work available at URL https://doi.org/10.1016/j.dam.2007.05.046

zbMATH Keywords

edge-connectivity augmentationsplitting offlocal edge-connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Constrained Edge-Splitting Problems
• Detachments Preserving Local Edge-Connectivity of Graphs
• scientific article; zbMATH DE number 1342136
• scientific article; zbMATH DE number 1187145
• Splitting off edges between two subsets preserving the edge-connectivity of the graph.

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• 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
• Edge-connectivity augmentations of~graphs~and~hypergraphs
• On a theorem of Mader
• The minimum augmentation of any graph to aK-edge-connected graph

Cited in

(6)

• Constrained Edge-Splitting Problems
• Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
• Edge-connectivity augmentations of~graphs~and~hypergraphs
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
• Detachments Preserving Local Edge-Connectivity of Graphs
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

This page was built for publication: Edge-splittings preserving local edge-connectivity of graphs

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