Characterization and Recognition of Partial 3-Trees
- 1 April 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (2), 305-314
- https://doi.org/10.1137/0607033
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- Networks immune to isolated line failuresNetworks, 1982
- Networks immune to isolated failuresNetworks, 1981
- Equations and Rewrite Rules: A SurveyPublished by Elsevier BV ,1980
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- On simple characterizations of k-treesDiscrete Mathematics, 1974
- Properties and characterizations of k ‐treesMathematika, 1971
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965