Просмотр кода страницы Partial k-tree

'''Partial <math>k</math>-tree''' --- частичное <math>k</math>-дерево. 

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