Characterization by forbidden induced subgraphs of some subclasses of chordal graphs

Sérgio H. Nogueira, Vinicius F. dos Santos

Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph…