Unichord-free graphs are defined as having vital nutrients vitex 750 no cycle with a unique chord.They have appeared in several papers recently and are also characterized by minimal separators always inducing edgeless subgraphs aboriginal flag beanie (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 vertex characterization of chordal graphs.