treewidth
integer invariant of an undirected graph which measures how far it is from being a tree
Press Enter · cited answer in seconds
0 sources
Summary
treewidth is a graph property[1]. treewidth draws 348 Wikipedia views per month (graph_property category, ranking #6 of 43).[2]
Key Facts
- treewidth is credited with the discovery of Francesco Brioschi[3].
- treewidth is credited with the discovery of Rudolf Halin[4].
- treewidth is credited with the discovery of Neil Robertson[5].
- treewidth is credited with the discovery of Paul Seymour[6].
- treewidth's instance of is recorded as graph property[7].
- treewidth's Stack Exchange tag is recorded as https://cstheory.stackexchange.com/tags/treewidth[8].
- treewidth's Stack Exchange tag is recorded as https://cs.stackexchange.com/tags/treewidth[9].
- treewidth's studied by is recorded as graph theory[10].
- treewidth's greater than is recorded as degeneracy[11].
- treewidth's greater than is recorded as chordality[12].
- treewidth's greater than is recorded as cop number[13].
- treewidth's less than is recorded as circumference[14].
- treewidth's less than is recorded as pathwidth[15].
- treewidth's less than is recorded as feedback vertex set number[16].
- treewidth's less than is recorded as carving width[17].
- treewidth's less than is recorded as branchwidth[18].
- treewidth's less than is recorded as positive semidefinite zero forcing number[19].
- treewidth's maintained by WikiProject is recorded as WikiProject Mathematics[20].
Body
Definition and Type
treewidth's instance of is recorded as graph property[7].
Why It Matters
treewidth draws 348 Wikipedia views per month (graph_property category, ranking #6 of 43).[2] treewidth has Wikipedia articles in 8 language editions, a strong signal of global cultural recognition.[21] treewidth is known by 15 alternative names across languages and contexts.[22]