chordal
- 2017 Diestel2017
- page 135 : chordal – … a graph is chordal (or triangulated) if each of its cycles of length at least $4$ has a chord, i.e. if it contains no induced cycles other than triangles.
- unknown
- chordal upper bounds perfect by a constant
- bounded perfect does not imply bounded chordal
- interval upper bounds chordal by a constant
- bounded chordal does not imply bounded interval
- block upper bounds chordal by a constant
- bounded chordal does not imply bounded block
- chordal upper bounds distance to chordal by a constant – by definition