Linked from

The 11 pages that link to Treewidth, each with the reason it gives.

• Parameterized complexityRelated: Many hard graph problems become tractable when parameterized by treewidth.

• Graph minorRelated: Excluded-minor structure helps explain which graphs have bounded treewidth.

• Fixed-parameter tractabilityRelated: Many otherwise hard graph problems admit algorithms whose exponential cost depends on treewidth.

• Planar separator theoremRelated: Small separators and tree decompositions express related forms of sparse graph structure.

• Robertson–Seymour theoremRelated: Bounded treewidth supplies tractable structure in important stages of minor theory.

• Wagner's theoremRelated: Planar graphs have structural constraints on treewidth that support algorithms and decomposition results.

• Cavity methodRelated: Low treewidth limits the correlations that complicate cavity approximations.

• Edge contractionRelated: Contraction preserves the upper bound on treewidth, making it useful in structural arguments.

• Courcelle's theoremRelated: A fixed bound on this parameter is the structural condition enabling linear-time evaluation.

• Erdős–Pósa theoremRelated: Structural graph parameters can characterize or control packing-covering behavior in graph families.

• Graph structure theoremRelated: Bounded treewidth is a key structural consequence for graphs excluding planar minors.