| 參考文獻: | [1] L.W. Beineke and R.E. Pippert, Properties and characterizations of k-trees, Mathematika, 18 (1971), 141-151.
[2] P. Bumeman, A characterization of rigid circuit graphs, Discrete Mathematics, 9 (1974), 205-212.
[3] M.B. Cozzens and F.S. Roberts, On dimensional properties of graphs, Graphs and Combinatorics, 5 (1989), 29-46.
[4] G.A. Dirac, A property of 4-chromatic graphs and some remarks on critical graphs, J. London Math. Soc., 27 (1952), 85-92.
[5] R.J. Dun, Topology of series parallel-networks, J. Math. Anal. Appl., 10 (1965), 303-318.
[6] F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory (B), 16 (1974), 47-56.
[7] Pinar Heggernes, Treewidth, partial k-trees, and chordal graphs, Delpensum INF 334- Institutt for informatikk, (2006).
[8] Terry A. McKee and Edward R. Sceinerman, On the Chordality of a Graph, Journal of Graph Theory, 17 (1993), 221-232.
[9] H.P. Patil, On the structure of k{trees, J. Combin. Inform. System. Sci., 11 (1986), 57-64.
[10] N. Roberston and P.D. Seymour, Graph minors II: algorithmic aspects of tree width, J. of Algorithms, 7 (1986), 309-322.
[11] D.J. Rose, On simple characterizations of k-trees, Discrete Math., 7 (1974), 317-322.
[12] J.R. Walter, Representations of chordal graphs as subtrees of a tree, J. Graph Theory, 2 (1978), 265-267. |
