| Reference: | [1] S. Benzer, On the topology of genetic fine structure, Pro. Nata. Acad. Sci. U.S.A. 45 (1959), 1607-1620.
[2] J.R. Blair and B.W. Peyton, An introduction to chordal graphs and clique trees, Tech. report, Oak Ridge National Laboratory, 1992.
[3] J.Ch. Boland and C.B. Lekkerkerker, Representation of finite graph by a set of intervals on the real line, Fund. Math. 51 (1962), 45-64.
[4] P.A. Buneman, A characterization of rigid circuit graphs, Discrete Math. 9 (1974), 205-212.
[5] Y.W. Chang, Graph representations using stars, trees, intervals and boxes, Ph. D. Thesis, University of Illinois at Urbana-Champaign (1994).
[6] Y.W. Chang, M.S. Jacobson, C.L. Monma and D.B. West, Subtree and substar intersection numbers, Discrete Appl. Math. 44 (1993), 205-220.
[7] F. Gavn`l, The intersection graphs of subtrees in tree are exactly the chordal graphs, J. Comb. Theory B 16 (1959), 47-56.
[8] J.R. Walter, Representations of chordal graphs as subtrees of a tree, J. Graph Theory 2 (1978), 265-267.
[9] D.B. West, Parameters in partial orders and graphs:Packing, coving and representation , Graphs and Order 2 (1985), 267-350.
[10] D.B. West, Introduction to graph theory, 1996, 293-297. |
