The 3-edge-components and a structural description of all 3-edge-cuts in a graph
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 145-157
- https://doi.org/10.1007/3-540-56402-0_44
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Applications of a poset representation to edge connectivity and graph rigidityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A fast algorithm for optimally increasing the edge-connectivityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Maintaining the 3-Edge-Connected Components of a Graph On-LineSIAM Journal on Computing, 1993
- Fully dynamic algorithms for edge connectivity problemsPublished by Association for Computing Machinery (ACM) ,1991
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Connectivity in GraphsPublished by University of Toronto Press Inc. (UTPress) ,1966