Tree decomposition: Difference between revisions

Content deleted Content added
BG19bot (talk | contribs)
m Definition: WP:CHECKWIKI error fix for #61. Punctuation goes before References. Do general fixes if a problem exists. - using AWB
Line 24:
 
==Treewidth==
{{main|Treewidth}}
 
The ''width'' of a tree decomposition is the size of its largest set ''X''<sub>''i''</sub> minus one. The [[treewidth]] tw(''G'') of a graph ''G'' is the minimum width among all possible tree decompositions of ''G''. In this definition, the size of the largest set is diminished by one in order to make the treewidth of a tree equal to one. Treewidth may also be defined from other structures than tree decompositions, including [[chordal graph]]s, [[bramble (graph theory)|brambles]], and [[haven (graph theory)|havens]].