A new characterization of unichord-free graphs | Zendy

Terry A. McKee | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A new characterization of unichord-free graphs

Author(s) -

Terry A. McKee

Publication year - 2015

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1831

Subject(s) - chordal graph , mathematics , combinatorics , treewidth , characterization (materials science) , vertex (graph theory) , indifference graph , chord (peer to peer) , pathwidth , split graph , interval graph , discrete mathematics , graph , 1 planar graph , computer science , line graph , materials science , nanotechnology , distributed computing

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 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 vertex characterization of chordal graphs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research