DAFTAR PUSTAKA
Buneman P, 1974. ”A Characterisation of Rigid Circuit Graphs”. Discrete Mathe-matics 9. North-Holland Publishing Company. Vol. 205-212.
Diestel R. 2010. ”Graph Theory Fourth Edition (Graduate Texts in Mathematics)”. Springer. Book.
Erdos P., Goodman A.W., dan Posa L. 1966. The Representation of a Graph by Set Intersection”,Canal. J. Math. 18 (1996) Vol. 106-112.
Faber M. 1981. Application of Linear Programming Dualityto Problems involving Independence and Domination.PhD Tesis. Simon Freser University.
Gavril, F. 1974. ”The Intersection Graph of SUbtrees in Tress are Exactly the Chordal Graphs”. Journal of Combinatorial Theory. Vol. (B) 47-56.
Golumbic M. C dan Robert E. J. 1985. ”The Edge Intersection Graphs of Paths in a Tree”.Journal of Combinatorial Theory, Vol. (B) 8-22.
Golumbic M. C dan Goss F. C. 1978. ”Perfect Elimination and Chordal Bipartite Graphs”. Courant Institute of Mathematical Sciences. New York University. Vol (155-163).
Hajnal. A. dan Suranyi. J, 1958. ”Uber die Auflosung von Graphen in Vollstandige Teilgraphen”.Ann. Unic. Sci. Budapest. EotvosSect. Math Vol. (113-121).
Huang J. 2006. ”Representasi Characterizations of Chordal Bipartite Graphs”. Jour-nal of Combinatorial Theory, Series B 96. Vol. 673-683. Elsevier
Jamison R.E., dan Mulder H.M., ”Tolerance Intersection Graphs on Binary Tree with Contant Tolerance 3.Economics Institut. Erasmus Universitiet. Technical Report.
Mckee A. T dan Mcmorris F. R. 1999. ”intersection Graph”. SIAM Monographs on Discrete Mathematics and Applications. Book
Nancy E., Zoltan F., Alexandr V. K., dan Jozef S. 2007. ”Tree Representation of Graph”, European Journal of Combinatorics. 28: Vol. 1087-1098. Elsevier
39
