Previous |  Up |  Next

Article

Title: Bipartite intersection graphs (English)
Author: Harary, Frank
Author: Kabell, Jerald A.
Author: McMorris, F. R.
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 23
Issue: 4
Year: 1982
Pages: 739-745
.
Category: math
.
MSC: 05C75
idZBL: Zbl 0516.05049
idMR: MR687568
.
Date available: 2008-06-05T21:13:24Z
Last updated: 2012-04-28
Stable URL: http://hdl.handle.net/10338.dmlcz/106192
.
Reference: [1] P. Buneman: A characterization of rigid circuit graphs.Discrete Math. 9 (1974), 205-212. MR 0357218
Reference: [2] F. Gavril: The intersection graphs of subtrees in trees are exactly the chordal graphs.J. Combin. Theory (B) 16 (1974), 47-56. Zbl 0266.05101, MR 0332541
Reference: [3] M. C. Golumbic C. F. Goss: Perfect elimination and chordal bipartite graphs.J. Graph Theory 2 (1978), 155-163. MR 0493395
Reference: [4] F. Harary: Graph Theory.Addison-Wesley, Reading (1969). Zbl 0196.27202, MR 0256911
Reference: [5] C. B. Lekkerkerker J. C. Boland: Representations of a finite graph by a set of intervals on the real line.Fund. Math. 51 (1962), 45-64. MR 0139159
Reference: [6] E. Marczewski: Sur deux propriétés des classes d'ensembles.Fund. Math. 33 (1945), 303-307. Zbl 0060.12508, MR 0015448
Reference: [7] F. R. McMorris D. Shier: Representing chordal graphs on a star.To appear in European J. Combin.
Reference: [8] F. Roberts: Discrete Mathematical Models.Prentice-Hall, Englewood Cliffs (1976). Zbl 0363.90002
Reference: [9] J. Walter: Representations of chordal graphs as subgraphs of a tree.J. Graph Theory 2 (1978), 265-267. MR 0505894
.

Files

Files Size Format View
CommentatMathUnivCarol_023-1982-4_11.pdf 524.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo