Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- 1 December 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (4) , 507-537
- https://doi.org/10.1016/0196-6774(88)90015-6
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Depth-First Search and Kuratowski SubgraphsJournal of the ACM, 1984
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Non-separating induced cycles in graphsJournal of Combinatorial Theory, Series B, 1981
- Efficient Planarity TestingJournal of the ACM, 1974
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- über minimaln-fach zusammenhängende, unendliche Graphen und ein ExtremalproblemArchiv der Mathematik, 1972
- A theory of 3-connected graphsIndagationes Mathematicae, 1961