On strictly chordality-k graphs

On strictly chordality-k graphs

Strictly Chordality-k graphs (SCk graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k,k≥3. Note that k=3 and k=4 are precisely the Chordal graphs and Chordal Bipartite graphs, respectively. In this paper, we initiate a structural and an algorithmic st...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2020-06, Vol.280, p.93-112
Hauptverfasser: Dhanalakshmi, S., Sadagopan, N.
Format: Artikel
Sprache:eng
Schlagworte:
Girth = chordality = [formula omitted]
Graphs
Minimal vertex separator
Treewidth
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Strictly Chordality-k graphs (SCk graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k,k≥3. Note that k=3 and k=4 are precisely the Chordal graphs and Chordal Bipartite graphs, respectively. In this paper, we initiate a structural and an algorithmic study of SCk,k≥5 graphs.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2018.06.028