一個圖補圖是完美圖本身也是完美圖。最初被稱為弱完美圖猜想 (Fulkerson 1971)，該結果隨後被 Lovász (1972) 證明，並因此被稱為完美圖定理 (Skiena 1990, p. 219; Cornuéjols 2002)。
完美圖定理
另請參閱
完美圖, 強完美圖定理使用 探索
參考文獻
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.Fulkerson, D. R. "Blocking and Anti-Blocking Pairs of Polyhedra." Math. Program. 1, 168-194, 1971.Lovász, L. "Normal Hypergraphs and the Perfect Graph Conjecture." Disc. Math. 2, 253-267, 1972.Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990.West, D. B. "The Perfect Graph Theorem." Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, pp. 226 and 320-323, 2000.在 中被引用
完美圖定理請這樣引用
Weisstein, Eric W. “完美圖定理。” 來自 —— 資源。 https://mathworld.tw/PerfectGraphTheorem.html