Partial k-tree

Материал из WikiGrapp
Перейти к:навигация, поиск

Partial k-tree --- частичное k-дерево.

A partial k-tree is a subgraph of a k-tree. The class of partial k-trees is exactly the class of graphs with a treewidth at most k. Note that, for each constant k, the class of partial k-trees is minor-closed.