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

Article

First Page Preview
Harary, Frank ; Kabell, Jerald A. ; McMorris, F. R.
Bipartite intersection graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 4, pp. 739-745
MSC: 05C75 | MR 687568 | Zbl 0516.05049
References:
[1] P. Buneman: A characterization of rigid circuit graphs. Discrete Math. 9 (1974), 205-212. MR 0357218
[2] F. Gavril: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory (B) 16 (1974), 47-56. MR 0332541 | Zbl 0266.05101
[3] M. C. Golumbic C. F. Goss: Perfect elimination and chordal bipartite graphs. J. Graph Theory 2 (1978), 155-163. MR 0493395
[4] F. Harary: Graph Theory. Addison-Wesley, Reading (1969). MR 0256911 | Zbl 0196.27202
[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
[6] E. Marczewski: Sur deux propriétés des classes d'ensembles. Fund. Math. 33 (1945), 303-307. MR 0015448 | Zbl 0060.12508
[7] F. R. McMorris D. Shier: Representing chordal graphs on a star. To appear in European J. Combin.
[8] F. Roberts: Discrete Mathematical Models. Prentice-Hall, Englewood Cliffs (1976). Zbl 0363.90002
[9] J. Walter: Representations of chordal graphs as subgraphs of a tree. J. Graph Theory 2 (1978), 265-267. MR 0505894
Partner of
EuDML logo