𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On simple characterizations of k-trees

✍ Scribed by Donald J. Rose

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
422 KB
Volume
7
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

k-trees are I special class of perfect elimination grap% which arise in the study of sparse linear systems. We present four simple ch,&r.xterizations of k-trees involving cliques, paths, and separators.

πŸ“œ SIMILAR VOLUMES

A characterization of k-trees
A characterization of k-trees
✍ Ralf FrΓΆberg πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 147 KB

The purpose of this note is to give a local criterion for a graph to be a k-tree. We show that a connected graph with the right number of edges is a k-tree if and only if the neighbourhood of each vertex is a (k -l)-tree.