Edge-splittings preserving local edge-connectivity of graphs

DOI10.1016/j.dam.2007.05.046zbMath1142.05051OpenAlexW2047053799MaRDI QIDQ2482096

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)

Related Items (2)

Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

Cites Work

• Unnamed Item
• On a theorem of Mader
• Edge-Connectivity Augmentations of Graphs and Hypergraphs
• 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

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