A New Characterization of Unichord-Free Graphs

Unichord-free graphs are defined as having no cycle with a unique chord.They have appeared in several papers recently transpharm online shopping and are also characterized by minimal separators always inducing edgeless subgraphs (in contrast to characterizing chordal graphs by minimal separators always inducing complete subgraphs).A new characterization of unichord-free graphs corresponds to a suitable reformulation of the standard simplicial johnny cash style clothing vertex characterization of chordal graphs.