Previous |  Up |  Next

Article

Title: Representing chordal graphs on $K_{1,n}$ (English)
Author: McMorris, F. R.
Author: Shier, Douglas R.
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 24
Issue: 3
Year: 1983
Pages: 489-494
.
Category: math
.
MSC: 05C05
MSC: 05C75
idZBL: Zbl 0536.05054
idMR: MR730144
.
Date available: 2008-06-05T21:15:55Z
Last updated: 2012-04-28
Stable URL: http://hdl.handle.net/10338.dmlcz/106248
.
Related article: http://dml.cz/handle/10338.dmlcz/106372
.
Reference: [1] J. A. BONDY U. S. R. MURTY: Graph Theory with Applications.American Elsevier, New York (1977). MR 0411988
Reference: [2] P. BUNEMAN: A characterization of rigid circuit graphs.Discrete Math. 9 (1974), 205-212. MR 0357218
Reference: [3] F. GAVRIL: The intersection graphs of subtrees in trees are exactly the chordal graphs.J. Combinatorial Theory Ser. B 16 (1974), 47-56. Zbl 0266.05101, MR 0332541
Reference: [4] M. C. GOLUMBIC: Algorithmic Graph Theory and Perfect Graphs.Academic Press, New York (1980). Zbl 0541.05054, MR 0562306
Reference: [5] J. KABELL: Intersection graphs: structure and invariants.Ph. D. thesis, University of Michigan (1980). MR 2630541
Reference: [6] J. R. WALTER: Representations of rigid cycle graphs.Ph. D. thesis, Wayne State University (1972). MR 2622336
Reference: [7] J. R. WALTER: Representations of chordal graphs as subtrees of a tree.J. Graph Theory 2 (1978), 265-267. Zbl 0441.05022, MR 0505894
.

Files

Files Size Format View
CommentatMathUnivCarol_024-1983-3_10.pdf 450.5Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo