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 53-264817 inducing edgeless subgraphs (in contrast to characterizing chordal graphs by minimal separators always inducing complete subgraphs).A na miata master cylinder new characterization of unichord-free graphs corresponds to a suitable reformulation of the standard simplicial vertex characterization of chordal graphs.