chordal

• unknown source
  • graph class chordal has constant distance to chordal – by definition
• 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
  • graph class chordal is included in graph class perfect
  • graph class perfect is not included in graph class chordal
  • graph class interval is included in graph class chordal
  • graph class chordal is not included in graph class interval
  • graph class block is included in graph class chordal
  • graph class chordal is not included in graph class block