Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call