A New Characterization of Unichord-Free Graphs

A New Characterization of Unichord-Free Graphs

Blog Article

Unichord-free graphs are defined as having no cycle with a unique chord.They have appeared in several papers recently and are also characterized by minimal separators always j??kaapin raikastin inducing edgeless subgraphs (in contrast to characterizing chordal graphs by minimal separators always buderim glace ginger inducing complete subgraphs).A new characterization of unichord-free graphs corresponds to a suitable reformulation of the standard simplicial vertex characterization of chordal graphs.