Dividing a Graph into Triconnected Components
- 1 September 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 2 (3), 135-158
- https://doi.org/10.1137/0202012
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Decomposition of a graph into compactly connected two-terminal subgraphsIEEE Transactions on Circuit Theory, 1971
- A new planarity test based on 3-connectivityIEEE Transactions on Circuit Theory, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Methods for Investigating Connectivity of Large GraphsIEEE Transactions on Circuit Theory, 1969
- Connectivity in GraphsPublished by University of Toronto Press Inc. (UTPress) ,1966
- A structural characterization of planar combinatorial graphsDuke Mathematical Journal, 1937