An algorithm for testing chordality of graphs
- 1 March 1975
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 3 (4) , 110-112
- https://doi.org/10.1016/0020-0190(75)90043-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Toward Characterization of Perfect Elimination DigraphsSIAM Journal on Computing, 1973
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961