Characterizations of strongly chordal graphs
- 1 January 1983
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 43 (2-3), 173-189
- https://doi.org/10.1016/0012-365x(83)90154-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Hypergraphs with no special cyclesCombinatorica, 1983
- Properties of (0, 1)-matrices with no trianglesJournal of Combinatorial Theory, Series A, 1980
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961