English K-tree Cited by user AdrienChen on 09 Apr 2013 The k-trees are exactly the maximal graphs with a given treewidth, graphs to which no more edges can be added without increasing their treewidth.