chordality
- 2022/09 Tran2022
- page 17 : chordality – The chordality of a graph $G$ is the minimum amount of chordal graphs required, such that their intersecten results in $G$
- 2019 Sorge2019
- page 9 : boxicity $k$ upper bounds chordality by $\mathcal O(k)$ – Lemma 4.15. The boxicity $b$ upper-bounds the chordality $c$. We have $c \le b$.
- https://onlinelibrary.wiley.com/doi/abs/10.1002/jgt.3190170210
- chordality – The \emph{chordality} of a graph $G=(V,E)$ is defined as the minimum $k$ such that we can write $E=E_1,\cap\dots\cap E_k$ with each $(V,E_i)$ a chordal graph.
- SchroderThesis
- page 19 : bounded clique cover number does not imply bounded chordality – Proposition 3.11
- page 19 : bounded distance to perfect does not imply bounded chordality – Proposition 3.11
- page 33 : bounded bisection bandwidth does not imply bounded chordality – Proposition 3.31
- page 36 : bounded average degree does not imply bounded chordality – Proposition 3.36
- unknown
- chromatic number $k$ upper bounds chordality by $f(k)$
- distance to chordal $k$ upper bounds chordality by $f(k)$
- distance to cograph $k$ upper bounds chordality by $f(k)$