2 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
R. Krithika, Rogers Mathew, N. S. Narayanaswamy +1
Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{á}tal et al. Note: Dirac-type characterizations of graphs without long chordles…