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.
• assumed
  • chordal upper bounds perfect by a constant
  • graph class perfect is not included in graph class chordal
  • interval upper bounds chordal by a constant
  • graph class chordal is not included in graph class interval
  • block upper bounds chordal by a constant
  • graph class chordal is not included in graph class block
• unknown
  • chordal upper bounds distance to chordal by a constant – by definition