Previous |  Up |  Next

Article

References:
[1] C. Berge: Graphs and Hypergraphs. North-Holland, Amsterdam, London 1973. MR 0357172 | Zbl 0254.05101
[2] K. P. Eswaran: Faithful representation of a family of sets by a set of intervals. SIAM J. Comput 4 (1975), 56-68. DOI 10.1137/0204005 | MR 0378509 | Zbl 0294.68007
[3] D. R. Fulkerson, O. A. Gross: Incidence matrices and interval graphs. Pacific J. Math. 15 (1965), 835-855. DOI 10.2140/pjm.1965.15.835 | MR 0186421 | Zbl 0132.21001
[4] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969. MR 0256911 | Zbl 0196.27202
[5] L. Nebeský: Graph theory and linguistics. In: Applications of Graph Theory (R. J. Wilson and L. W. Beineke, eds.). Academic Press, London 1979, pp. 357-380. MR 0567125
[6] W. T. Trotter, Jr., J. I. Moore, Jr.: Characterization problems for graphs, partially ordered sets, lattices, and families of sets. Discrete Mathematics 16 (1976), 361 - 381. DOI 10.1016/S0012-365X(76)80011-8 | MR 0450140
[7] A. Tucker: A structure theorem for the consecutive 1's property. J. Combinatorial Theory 12 (B) (1972), 153-162. DOI 10.1016/0095-8956(72)90019-6 | MR 0295938 | Zbl 0208.52402
Partner of
EuDML logo