# treewidth

> integer invariant of an undirected graph which measures how far it is from being a tree

**Wikidata**: [Q5067368](https://www.wikidata.org/wiki/Q5067368)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Treewidth)  
**Source**: https://4ort.xyz/entity/treewidth


## References

1. [Graph parameters and cliques in supergraphs](https://11011110.github.io/blog/2012/11/15/graph-parameters-and.html)
2. Girth and treewidth
3. On the chordality of a graph
4. The cops and robber game on graphs with forbidden (induced) subgraphs
5. Tree-width and circumference of graphs
6. Defective and clustered colouring of graphs with given girth
7. Comparing 17 graph parameters
8. Graph minors. X. Obstructions to tree-decomposition
9. Parameters related to tree-width, zero forcing, and maximum nullity of a graph
10. [OpenAlex](https://docs.openalex.org/download-snapshot/snapshot-data-format)