@article{CMUC_1983_24_3_a9,
author = {McMorris, F. R. and Shier, Douglas R.},
title = {Representing chordal graphs on $K_{1,n}$},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {489--494},
year = {1983},
volume = {24},
number = {3},
mrnumber = {730144},
zbl = {0536.05054},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_1983_24_3_a9/}
}
McMorris, F. R.; Shier, Douglas R. Representing chordal graphs on $K_{1,n}$. Commentationes Mathematicae Universitatis Carolinae, Tome 24 (1983) no. 3, pp. 489-494. http://geodesic.mathdoc.fr/item/CMUC_1983_24_3_a9/
[1] J. A. BONDY U. S. R. MURTY: Graph Theory with Applications. American Elsevier, New York (1977). | MR
[2] P. BUNEMAN: A characterization of rigid circuit graphs. Discrete Math. 9 (1974), 205-212. | MR
[3] F. GAVRIL: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combinatorial Theory Ser. B 16 (1974), 47-56. | MR | Zbl
[4] M. C. GOLUMBIC: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980). | MR | Zbl
[5] J. KABELL: Intersection graphs: structure and invariants. Ph. D. thesis, University of Michigan (1980). | MR
[6] J. R. WALTER: Representations of rigid cycle graphs. Ph. D. thesis, Wayne State University (1972). | MR
[7] J. R. WALTER: Representations of chordal graphs as subtrees of a tree. J. Graph Theory 2 (1978), 265-267. | MR | Zbl