About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
McMorris, F. R. ; Shier, Douglas R.
Representing chordal graphs on $K_{1,n}$. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 24 (1983), issue 3, pp. 489-494
MSC: 05C05, 05C75 | MR 730144 | Zbl 0536.05054
Related articles:
Note on a paper of McMorris and Shier
References:
[1] J. A. BONDY U. S. R. MURTY: Graph Theory with Applications. American Elsevier, New York (1977). MR 0411988
[2] P. BUNEMAN: A characterization of rigid circuit graphs. Discrete Math. 9 (1974), 205-212. MR 0357218
[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 0332541 | Zbl 0266.05101
[4] M. C. GOLUMBIC: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980). MR 0562306 | Zbl 0541.05054
[5] J. KABELL: Intersection graphs: structure and invariants. Ph. D. thesis, University of Michigan (1980). MR 2630541
[6] J. R. WALTER: Representations of rigid cycle graphs. Ph. D. thesis, Wayne State University (1972). MR 2622336
[7] J. R. WALTER: Representations of chordal graphs as subtrees of a tree. J. Graph Theory 2 (1978), 265-267. MR 0505894 | Zbl 0441.05022
Partner of
EuDML logo