Edge-splittings preserving local edge-connectivity of graphs
From MaRDI portal
Publication:2482096
DOI10.1016/J.DAM.2007.05.046zbMATH Open1142.05051OpenAlexW2047053799MaRDI QIDQ2482096FDOQ2482096
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
Recommendations
Cites Work
- A Reduction Method for Edge-Connectivity in Graphs
- Title not available (Why is that?)
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- On a theorem of Mader
- Edge-Connectivity Augmentation with Partition Constraints
- Edge-Connectivity Augmentations of Graphs and Hypergraphs
- The minimum augmentation of any graph to aK-edge-connected graph
- Edge-Connectivity Augmentation Preserving Simplicity
Cited In (6)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
- Edge-Connectivity Augmentations of Graphs and Hypergraphs
- Detachments Preserving Local Edge-Connectivity of Graphs
- Constrained Edge-Splitting Problems
- Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
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)
