Abstract
Recently in several papers ([10],[22],[42]) independently graphs with maximum neighbourhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for characterizations of those graphs in terms of neighbourhood and clique hypergraphs which have the Helly property and whose line graph is chordal. These graphs are dual (in the sense of hypergraphs) to chordal graphs. By using the hypergraph approach in a systematical way new results are obtained, some of the old results are generalized and some of the proofs are simplified.
Cite
CITATION STYLE
Brandstädt, A., Dragan, F. F., Chepoi, V. D., & Voloshin, V. I. (1994). Dually chordal graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 790 LNCS, pp. 237–251). Springer Verlag. https://doi.org/10.1007/3-540-57899-4_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
