Edited by 

List price: US$38.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, a k-tree is a chordal graph all of whose maximal cliques are the same size k + 1 and all of whose minimal clique separators are also all the same size k. 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. The graphs that have treewidth at most k are exactly the subgraphs of k-trees, and for this reason they are called partial k-trees. Every k-tree may be formed by starting with a-vertex complete graph and then repeatedly adding vertices in such a way that each added vertex has exactly k neighbors that form a clique.show more

Product details

  • Paperback | 52 pages
  • 152 x 229 x 3mm | 91g
  • Volvpress
  • United States
  • English
  • black & white illustrations
  • 6136325217
  • 9786136325217