On Simple Characterizations of k-trees.

摘要

K-trees are a special class of perfect elimination graphs which arise in the study of sparse linear systems. The author presents four simple characterizations of k-trees involving cliques,paths,and separators. (Author)