Triangulating graphs without asteroidal triples

This publication has 17 references indexed in Scilit:

• Treewidth of cocomparability graphs and a new order-theoretic parameter
  Order, 1994
• On the pathwidth of chordal graphs
  Discrete Applied Mathematics, 1993
• The Pathwidth and Treewidth of Cographs
  SIAM Journal on Discrete Mathematics, 1993
• Graph Problems Related to Gate Matrix Layout and PLA Folding
  Published by Springer Nature ,1990
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• Decomposition by clique separators
  Discrete Mathematics, 1985
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
  BIT Numerical Mathematics, 1985
• Tolerance graphs
  Discrete Applied Mathematics, 1984
• Computing the Minimum Fill-In is NP-Complete
  SIAM Journal on Algebraic Discrete Methods, 1981
• Triangulated graphs and the elimination process
  Journal of Mathematical Analysis and Applications, 1970