A New Characterization of Unichord-Free Graphs
Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 4, pp. 765-771
Voir la notice de l'article provenant de la source Library of Science
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.
Keywords:
chordal graph, unichord-free graph, minimal separator
@article{DMGT_2015_35_4_a12,
author = {McKee, Terry A.},
title = {A {New} {Characterization} of {Unichord-Free} {Graphs}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {765--771},
publisher = {mathdoc},
volume = {35},
number = {4},
year = {2015},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a12/}
}
McKee, Terry A. A New Characterization of Unichord-Free Graphs. Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 4, pp. 765-771. http://geodesic.mathdoc.fr/item/DMGT_2015_35_4_a12/