Strongly Chordal Graph Generation using Intersection Graph Characterisation
From MaRDI portal
Publication:6324754
Abstract: Strongly chordal graphs are a subclass of chordal graphs. Farber also established a number of different characterisations for this class of graphs. These include an intersection graph characterisation that is analogous to a similar characterisation for chordal graphs. Seker et al. exploited this characterisation of chordal graphs to obtain an algorithm for generating them. In this paper, we propose an algorithm to show that strongly chordal graphs can also be generated using their intersection graph characterisation.
This page was built for publication: Strongly Chordal Graph Generation using Intersection Graph Characterisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324754)
