Tree Decomposition

Christoph Dittmann 🌐

May 31, 2016

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


We formalize tree decompositions and tree width in Isabelle/HOL, proving that trees have treewidth 1. We also show that every edge of a tree decomposition is a separation of the underlying graph. As an application of this theorem we prove that complete graphs of size n have treewidth n-1.


BSD License


Session Tree_Decomposition