Values
No modified entries
Description
The treewidth of a graph.
A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
References
Diff References
[1] [[wikipedia:Treewidth]]
[2] [[wikipedia:Partial_k-tree]]
[3] [[wikipedia:Bramble_(graph_theory)]]
[4] [[wikipedia:Pursuit–evasion]]
[5] [[wikipedia:Chordal_completion]]
[2] [[wikipedia:Partial_k-tree]]
[3] [[wikipedia:Bramble_(graph_theory)]]
[4] [[wikipedia:Pursuit–evasion]]
[5] [[wikipedia:Chordal_completion]]
Code
def statistic(g):
return g.treewidth()
Created
Jul 28, 2015 at 13:58 by Martin Rubey
Updated
Mar 13, 2025 at 17:25 by Alexandros Leivaditis
