Characterization of partial 3-trees in terms of three structures
- 1 December 1986
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 2 (1) , 233-246
- https://doi.org/10.1007/bf01788098
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Separating subgraphs in k-trees: Cables and caterpillarsDiscrete Mathematics, 1984
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- Networks immune to isolated failuresNetworks, 1981
- The Art of Computer Programming, Vol. 3: Sorting and SearchingMathematics of Computation, 1974
- On simple characterizations of k-treesDiscrete Mathematics, 1974
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- Properties and characterizations of k ‐treesMathematika, 1971