An Introduction to Chordal Graphs and Clique Trees

This publication has 28 references indexed in Scilit:

• On finding minimum-diameter clique trees
  Published by Office of Scientific and Technical Information (OSTI) ,1991
• Generating the maximum spanning trees of a weighted graph
  Journal of Algorithms, 1987
• The theory of convex geometries
  Geometriae Dedicata, 1985
• On the Desirability of Acyclic Database Schemes
  Journal of the ACM, 1983
• A Note on the Work Involved in No-fill Sparse Matrix Factorization
  IMA Journal of Numerical Analysis, 1983
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
  SIAM Journal on Numerical Analysis, 1978
• A characterisation of rigid circuit graphs
  Discrete Mathematics, 1974
• The intersection graphs of subtrees in trees are exactly the chordal graphs
  Journal of Combinatorial Theory, Series B, 1974
• Nested Dissection of a Regular Finite Element Mesh
  SIAM Journal on Numerical Analysis, 1973
• On rigid circuit graphs
  Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961