Berge, C. "Les problèmes de coloration en théorie des graphes." Publ. Inst. Stat. Univ. Paris9, 123-160, 1960.Berge, C. "Färbung von Graphen deren sämtliche beziehungsweise deren ungerade Kreise starr sind (Zusammenfassung)." Wissenschaftliche Zeitschrift, Martin Luther Univ. Halle-Wittenberg, Math.-Naturwiss. Reihe, 114-115, 1961.Berge, C. 和 Ramírez-Alfonsiin, J. L. "Origins and Genesis." In Perfect Graphs (Ed. J. L. Ramírez-Alfonsín 和 B. A. Reed)。纽约:Wiley,pp. 1-12, 2001。Chvátal, V. "The Strong Perfect Graph Theorem." http://www.cs.concordia.ca/~chvatal/perfect/spgt.html.Cornuéjols, G. "The Strong Perfect Graph Conjecture." International Congress of Mathematics, Beijing, China, 2002, Vol. 3. pp. 547-559. http://integer.gsia.cmu.edu/webpub/SPGCsurvey.pdf.Fonlupt, J. 和 Sebő, A. "On the Clique-Rank and the Coloration of Prefect Graphs." In Integer Programming and Combinatorial Optimization, Vol. 1 (Ed. R. Kannan 和 W. R. Pulleyblank)。滑铁卢,安大略省:University of Waterloo,pp. 201-216, 1990。Golumbic, M. C. Algorithmic Graph Theory and Perfect Graphs. 纽约:Academic Press,1980。Jensen, T. R. 和 Toft, B. Graph Coloring Problems. 纽约:Wiley,1995。MacKenzie, D. "Graph Theory Uncovers the Roots of Perfection." Science297, 38, 2002.Sebő, A. "On Critical Edges in Minimal Perfect Graphs." J. Combin. Th. B67, 62-85, 1996.Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. 雷丁,马萨诸塞州:Addison-Wesley,1990。West, D. B. "The Strong Perfect Graph Conjecture." Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ:Prentice-Hall,pp. 341-344, 2000。