Author:
Mukhopadhyay Asish,Rahman Md. Zamilur
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Dahlhaus, E., Manuel, P.D., Miller, M.: A characterization of strongly chordal graphs. Discret. Math. 187(1–3), 269–271 (1998)
2. Farber, M.: Applications of 1.p. duality to problems involving independence and domination. Ph.D. thesis, Rutgers University (1982)
3. Farber, M.: Characterizations of strongly chordal graphs. Discret. Math. 43(2–3), 173–189 (1983)
4. Farber, M.: Domination, independent domination, and duality in strongly chordal graphs. Discret. Appl. Math. 7(2), 115–130 (1984)
5. Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16(1), 47–56 (1974)